--- /dev/null
+TOPSRCDIR = @top_srcdir@\r
+TOPOBJDIR = ../..\r
+SRCDIR = @srcdir@\r
+VPATH = @srcdir@\r
+MODULE = cabinet.dll\r
+IMPORTS = kernel32\r
+\r
+C_SRCS = \\r
+ cabextract.c \\r
+ cabinet_main.c \\r
+ fci.c \\r
+ fdi.c\r
+\r
+RC_SRCS = cabinet.rc\r
+\r
+@MAKE_DLL_RULES@\r
+\r
+### Dependencies:\r
--- /dev/null
+/*\r
+ * cabextract.c\r
+ *\r
+ * Copyright 2000-2002 Stuart Caie\r
+ *\r
+ * This library is free software; you can redistribute it and/or\r
+ * modify it under the terms of the GNU Lesser General Public\r
+ * License as published by the Free Software Foundation; either\r
+ * version 2.1 of the License, or (at your option) any later version.\r
+ *\r
+ * This library is distributed in the hope that it will be useful,\r
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of\r
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r
+ * Lesser General Public License for more details.\r
+ *\r
+ * You should have received a copy of the GNU Lesser General Public\r
+ * License along with this library; if not, write to the Free Software\r
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\r
+ *\r
+ * Principal author: Stuart Caie <kyzer@4u.net>\r
+ *\r
+ * Based on specification documents from Microsoft Corporation\r
+ * Quantum decompression researched and implemented by Matthew Russoto\r
+ * Huffman code adapted from unlzx by Dave Tritscher.\r
+ * InfoZip team's INFLATE implementation adapted to MSZIP by Dirk Stoecker.\r
+ * Major LZX fixes by Jae Jung.\r
+ */\r
+ \r
+#include "config.h"\r
+\r
+#include <stdarg.h>\r
+#include <stdio.h>\r
+#include <stdlib.h>\r
+\r
+#include "windef.h"\r
+#include "winbase.h"\r
+#include "winerror.h"\r
+\r
+#include "cabinet.h"\r
+\r
+#include "wine/debug.h"\r
+\r
+WINE_DEFAULT_DEBUG_CHANNEL(cabinet);\r
+\r
+THOSE_ZIP_CONSTS;\r
+\r
+/* all the file IO is abstracted into these routines:\r
+ * cabinet_(open|close|read|seek|skip|getoffset)\r
+ * file_(open|close|write)\r
+ */\r
+\r
+/* try to open a cabinet file, returns success */\r
+BOOL cabinet_open(struct cabinet *cab)\r
+{\r
+ const char *name = cab->filename;\r
+ HANDLE fh;\r
+\r
+ TRACE("(cab == ^%p)\n", cab);\r
+\r
+ if ((fh = CreateFileA( name, GENERIC_READ, FILE_SHARE_READ,\r
+ NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL )) == INVALID_HANDLE_VALUE) {\r
+ ERR("Couldn't open %s\n", debugstr_a(name));\r
+ return FALSE;\r
+ }\r
+\r
+ /* seek to end of file and get the length */\r
+ if ((cab->filelen = SetFilePointer(fh, 0, NULL, FILE_END)) == INVALID_SET_FILE_POINTER) {\r
+ if (GetLastError() != NO_ERROR) {\r
+ ERR("Seek END failed: %s\n", debugstr_a(name));\r
+ CloseHandle(fh);\r
+ return FALSE;\r
+ }\r
+ }\r
+\r
+ /* return to the start of the file */\r
+ if (SetFilePointer(fh, 0, NULL, FILE_BEGIN) == INVALID_SET_FILE_POINTER) {\r
+ ERR("Seek BEGIN failed: %s\n", debugstr_a(name));\r
+ CloseHandle(fh);\r
+ return FALSE;\r
+ }\r
+\r
+ cab->fh = fh;\r
+ return TRUE;\r
+}\r
+\r
+/*******************************************************************\r
+ * cabinet_close (internal)\r
+ *\r
+ * close the file handle in a struct cabinet.\r
+ */\r
+void cabinet_close(struct cabinet *cab) {\r
+ TRACE("(cab == ^%p)\n", cab);\r
+ if (cab->fh) CloseHandle(cab->fh);\r
+ cab->fh = 0;\r
+}\r
+\r
+/*******************************************************\r
+ * ensure_filepath2 (internal)\r
+ */\r
+BOOL ensure_filepath2(char *path) {\r
+ BOOL ret = TRUE;\r
+ int len;\r
+ char *new_path;\r
+\r
+ new_path = HeapAlloc(GetProcessHeap(), 0, (strlen(path) + 1));\r
+ strcpy(new_path, path);\r
+\r
+ while((len = strlen(new_path)) && new_path[len - 1] == '\\')\r
+ new_path[len - 1] = 0;\r
+\r
+ TRACE("About to try to create directory %s\n", debugstr_a(new_path));\r
+ while(!CreateDirectoryA(new_path, NULL)) {\r
+ char *slash;\r
+ DWORD last_error = GetLastError();\r
+\r
+ if(last_error == ERROR_ALREADY_EXISTS)\r
+ break;\r
+\r
+ if(last_error != ERROR_PATH_NOT_FOUND) {\r
+ ret = FALSE;\r
+ break;\r
+ }\r
+\r
+ if(!(slash = strrchr(new_path, '\\'))) {\r
+ ret = FALSE;\r
+ break;\r
+ }\r
+\r
+ len = slash - new_path;\r
+ new_path[len] = 0;\r
+ if(! ensure_filepath2(new_path)) {\r
+ ret = FALSE;\r
+ break;\r
+ }\r
+ new_path[len] = '\\';\r
+ TRACE("New path in next iteration: %s\n", debugstr_a(new_path));\r
+ }\r
+\r
+ HeapFree(GetProcessHeap(), 0, new_path);\r
+ return ret;\r
+}\r
+\r
+\r
+/**********************************************************************\r
+ * ensure_filepath (internal)\r
+ *\r
+ * ensure_filepath("a\b\c\d.txt") ensures a, a\b and a\b\c exist as dirs\r
+ */\r
+BOOL ensure_filepath(char *path) {\r
+ char new_path[MAX_PATH];\r
+ int len, i, lastslashpos = -1;\r
+\r
+ TRACE("(path == %s)\n", debugstr_a(path));\r
+\r
+ strcpy(new_path, path); \r
+ /* remove trailing slashes (shouldn't need to but wth...) */\r
+ while ((len = strlen(new_path)) && new_path[len - 1] == '\\')\r
+ new_path[len - 1] = 0;\r
+ /* find the position of the last '\\' */\r
+ for (i=0; i<MAX_PATH; i++) {\r
+ if (new_path[i] == 0) break; \r
+ if (new_path[i] == '\\')\r
+ lastslashpos = i;\r
+ }\r
+ if (lastslashpos > 0) {\r
+ new_path[lastslashpos] = 0;\r
+ /* may be trailing slashes but ensure_filepath2 will chop them */\r
+ return ensure_filepath2(new_path);\r
+ } else\r
+ return TRUE; /* ? */\r
+}\r
+\r
+/*******************************************************************\r
+ * file_open (internal)\r
+ *\r
+ * opens a file for output, returns success\r
+ */\r
+BOOL file_open(struct cab_file *fi, BOOL lower, LPCSTR dir)\r
+{\r
+ char c, *d, *name;\r
+ BOOL ok = FALSE;\r
+ const char *s;\r
+\r
+ TRACE("(fi == ^%p, lower == %s, dir == %s)\n", fi, lower ? "TRUE" : "FALSE", debugstr_a(dir));\r
+\r
+ if (!(name = malloc(strlen(fi->filename) + (dir ? strlen(dir) : 0) + 2))) {\r
+ ERR("out of memory!\n");\r
+ return FALSE;\r
+ }\r
+ \r
+ /* start with blank name */\r
+ *name = 0;\r
+\r
+ /* add output directory if needed */\r
+ if (dir) {\r
+ strcpy(name, dir);\r
+ strcat(name, "\\");\r
+ }\r
+\r
+ /* remove leading slashes */\r
+ s = (char *) fi->filename;\r
+ while (*s == '\\') s++;\r
+\r
+ /* copy from fi->filename to new name.\r
+ * lowercases characters if needed.\r
+ */\r
+ d = &name[strlen(name)];\r
+ do {\r
+ c = *s++;\r
+ *d++ = (lower ? tolower((unsigned char) c) : c);\r
+ } while (c);\r
+\r
+ /* create directories if needed, attempt to write file */\r
+ if (ensure_filepath(name)) {\r
+ fi->fh = CreateFileA(name, GENERIC_WRITE, 0, NULL,\r
+ CREATE_ALWAYS, FILE_ATTRIBUTE_NORMAL, 0);\r
+ if (fi->fh != INVALID_HANDLE_VALUE)\r
+ ok = TRUE;\r
+ else {\r
+ ERR("CreateFileA returned INVALID_HANDLE_VALUE\n");\r
+ fi->fh = 0;\r
+ }\r
+ } else \r
+ ERR("Couldn't ensure filepath for %s\n", debugstr_a(name));\r
+\r
+ if (!ok) {\r
+ ERR("Couldn't open file %s for writing\n", debugstr_a(name));\r
+ }\r
+\r
+ /* as full filename is no longer needed, free it */\r
+ free(name);\r
+\r
+ return ok;\r
+}\r
+\r
+/********************************************************\r
+ * close_file (internal)\r
+ *\r
+ * closes a completed file\r
+ */\r
+void file_close(struct cab_file *fi)\r
+{\r
+ TRACE("(fi == ^%p)\n", fi);\r
+\r
+ if (fi->fh) {\r
+ CloseHandle(fi->fh);\r
+ }\r
+ fi->fh = 0;\r
+}\r
+\r
+/******************************************************************\r
+ * file_write (internal)\r
+ *\r
+ * writes from buf to a file specified as a cab_file struct.\r
+ * returns success/failure\r
+ */\r
+BOOL file_write(struct cab_file *fi, cab_UBYTE *buf, cab_off_t length)\r
+{\r
+ DWORD bytes_written;\r
+\r
+ TRACE("(fi == ^%p, buf == ^%p, length == %u)\n", fi, buf, length);\r
+\r
+ if ((!WriteFile( fi->fh, (LPCVOID) buf, length, &bytes_written, FALSE) ||\r
+ (bytes_written != length))) {\r
+ ERR("Error writing file: %s\n", debugstr_a(fi->filename));\r
+ return FALSE;\r
+ }\r
+ return TRUE;\r
+}\r
+\r
+\r
+/*******************************************************************\r
+ * cabinet_skip (internal)\r
+ *\r
+ * advance the file pointer associated with the cab structure\r
+ * by distance bytes\r
+ */\r
+void cabinet_skip(struct cabinet *cab, cab_off_t distance)\r
+{\r
+ TRACE("(cab == ^%p, distance == %u)\n", cab, distance);\r
+ if (SetFilePointer(cab->fh, distance, NULL, FILE_CURRENT) == INVALID_SET_FILE_POINTER) {\r
+ if (distance != INVALID_SET_FILE_POINTER)\r
+ ERR("%s\n", debugstr_a(cab->filename));\r
+ }\r
+}\r
+\r
+/*******************************************************************\r
+ * cabinet_seek (internal)\r
+ *\r
+ * seek to the specified absolute offset in a cab\r
+ */\r
+void cabinet_seek(struct cabinet *cab, cab_off_t offset) {\r
+ TRACE("(cab == ^%p, offset == %u)\n", cab, offset);\r
+ if (SetFilePointer(cab->fh, offset, NULL, FILE_BEGIN) != offset)\r
+ ERR("%s seek failure\n", debugstr_a(cab->filename));\r
+}\r
+\r
+/*******************************************************************\r
+ * cabinet_getoffset (internal)\r
+ *\r
+ * returns the file pointer position of a cab\r
+ */\r
+cab_off_t cabinet_getoffset(struct cabinet *cab) \r
+{\r
+ return SetFilePointer(cab->fh, 0, NULL, FILE_CURRENT);\r
+}\r
+\r
+/*******************************************************************\r
+ * cabinet_read (internal)\r
+ *\r
+ * read data from a cabinet, returns success\r
+ */\r
+BOOL cabinet_read(struct cabinet *cab, cab_UBYTE *buf, cab_off_t length)\r
+{\r
+ DWORD bytes_read;\r
+ cab_off_t avail = cab->filelen - cabinet_getoffset(cab);\r
+\r
+ TRACE("(cab == ^%p, buf == ^%p, length == %u)\n", cab, buf, length);\r
+\r
+ if (length > avail) {\r
+ WARN("%s: WARNING; cabinet is truncated\n", debugstr_a(cab->filename));\r
+ length = avail;\r
+ }\r
+\r
+ if (! ReadFile( cab->fh, (LPVOID) buf, length, &bytes_read, NULL )) {\r
+ ERR("%s read error\n", debugstr_a(cab->filename));\r
+ return FALSE;\r
+ } else if (bytes_read != length) {\r
+ ERR("%s read size mismatch\n", debugstr_a(cab->filename));\r
+ return FALSE;\r
+ }\r
+\r
+ return TRUE;\r
+}\r
+\r
+/**********************************************************************\r
+ * cabinet_read_string (internal)\r
+ *\r
+ * allocate and read an aribitrarily long string from the cabinet\r
+ */\r
+char *cabinet_read_string(struct cabinet *cab)\r
+{\r
+ cab_off_t len=256, base = cabinet_getoffset(cab), maxlen = cab->filelen - base;\r
+ BOOL ok = FALSE;\r
+ unsigned int i;\r
+ cab_UBYTE *buf = NULL;\r
+\r
+ TRACE("(cab == ^%p)\n", cab);\r
+\r
+ do {\r
+ if (len > maxlen) len = maxlen;\r
+ if (!(buf = realloc(buf, (size_t) len))) break;\r
+ if (!cabinet_read(cab, buf, (size_t) len)) break;\r
+\r
+ /* search for a null terminator in what we've just read */\r
+ for (i=0; i < len; i++) {\r
+ if (!buf[i]) {ok=TRUE; break;}\r
+ }\r
+\r
+ if (!ok) {\r
+ if (len == maxlen) {\r
+ ERR("%s: WARNING; cabinet is truncated\n", debugstr_a(cab->filename));\r
+ break;\r
+ }\r
+ len += 256;\r
+ cabinet_seek(cab, base);\r
+ }\r
+ } while (!ok);\r
+\r
+ if (!ok) {\r
+ if (buf)\r
+ free(buf);\r
+ else\r
+ ERR("out of memory!\n");\r
+ return NULL;\r
+ }\r
+\r
+ /* otherwise, set the stream to just after the string and return */\r
+ cabinet_seek(cab, base + ((cab_off_t) strlen((char *) buf)) + 1);\r
+\r
+ return (char *) buf;\r
+}\r
+\r
+/******************************************************************\r
+ * cabinet_read_entries (internal)\r
+ *\r
+ * reads the header and all folder and file entries in this cabinet\r
+ */\r
+BOOL cabinet_read_entries(struct cabinet *cab)\r
+{\r
+ int num_folders, num_files, header_resv, folder_resv = 0, i;\r
+ struct cab_folder *fol, *linkfol = NULL;\r
+ struct cab_file *file, *linkfile = NULL;\r
+ cab_off_t base_offset;\r
+ cab_UBYTE buf[64];\r
+\r
+ TRACE("(cab == ^%p)\n", cab);\r
+\r
+ /* read in the CFHEADER */\r
+ base_offset = cabinet_getoffset(cab);\r
+ if (!cabinet_read(cab, buf, cfhead_SIZEOF)) {\r
+ return FALSE;\r
+ }\r
+ \r
+ /* check basic MSCF signature */\r
+ if (EndGetI32(buf+cfhead_Signature) != 0x4643534d) {\r
+ ERR("%s: not a Microsoft cabinet file\n", debugstr_a(cab->filename));\r
+ return FALSE;\r
+ }\r
+\r
+ /* get the number of folders */\r
+ num_folders = EndGetI16(buf+cfhead_NumFolders);\r
+ if (num_folders == 0) {\r
+ ERR("%s: no folders in cabinet\n", debugstr_a(cab->filename));\r
+ return FALSE;\r
+ }\r
+\r
+ /* get the number of files */\r
+ num_files = EndGetI16(buf+cfhead_NumFiles);\r
+ if (num_files == 0) {\r
+ ERR("%s: no files in cabinet\n", debugstr_a(cab->filename));\r
+ return FALSE;\r
+ }\r
+\r
+ /* just check the header revision */\r
+ if ((buf[cfhead_MajorVersion] > 1) ||\r
+ (buf[cfhead_MajorVersion] == 1 && buf[cfhead_MinorVersion] > 3))\r
+ {\r
+ WARN("%s: WARNING; cabinet format version > 1.3\n", debugstr_a(cab->filename));\r
+ }\r
+\r
+ /* read the reserved-sizes part of header, if present */\r
+ cab->flags = EndGetI16(buf+cfhead_Flags);\r
+ if (cab->flags & cfheadRESERVE_PRESENT) {\r
+ if (!cabinet_read(cab, buf, cfheadext_SIZEOF)) return FALSE;\r
+ header_resv = EndGetI16(buf+cfheadext_HeaderReserved);\r
+ folder_resv = buf[cfheadext_FolderReserved];\r
+ cab->block_resv = buf[cfheadext_DataReserved];\r
+\r
+ if (header_resv > 60000) {\r
+ WARN("%s: WARNING; header reserved space > 60000\n", debugstr_a(cab->filename));\r
+ }\r
+\r
+ /* skip the reserved header */\r
+ if (header_resv) \r
+ if (SetFilePointer(cab->fh, (cab_off_t) header_resv, NULL, FILE_CURRENT) == INVALID_SET_FILE_POINTER)\r
+ ERR("seek failure: %s\n", debugstr_a(cab->filename));\r
+ }\r
+\r
+ if (cab->flags & cfheadPREV_CABINET) {\r
+ cab->prevname = cabinet_read_string(cab);\r
+ if (!cab->prevname) return FALSE;\r
+ cab->previnfo = cabinet_read_string(cab);\r
+ }\r
+\r
+ if (cab->flags & cfheadNEXT_CABINET) {\r
+ cab->nextname = cabinet_read_string(cab);\r
+ if (!cab->nextname) return FALSE;\r
+ cab->nextinfo = cabinet_read_string(cab);\r
+ }\r
+\r
+ /* read folders */\r
+ for (i = 0; i < num_folders; i++) {\r
+ if (!cabinet_read(cab, buf, cffold_SIZEOF)) return FALSE;\r
+ if (folder_resv) cabinet_skip(cab, folder_resv);\r
+\r
+ fol = (struct cab_folder *) calloc(1, sizeof(struct cab_folder));\r
+ if (!fol) {\r
+ ERR("out of memory!\n");\r
+ return FALSE;\r
+ }\r
+\r
+ fol->cab[0] = cab;\r
+ fol->offset[0] = base_offset + (cab_off_t) EndGetI32(buf+cffold_DataOffset);\r
+ fol->num_blocks = EndGetI16(buf+cffold_NumBlocks);\r
+ fol->comp_type = EndGetI16(buf+cffold_CompType);\r
+\r
+ if (!linkfol) \r
+ cab->folders = fol; \r
+ else \r
+ linkfol->next = fol;\r
+\r
+ linkfol = fol;\r
+ }\r
+\r
+ /* read files */\r
+ for (i = 0; i < num_files; i++) {\r
+ if (!cabinet_read(cab, buf, cffile_SIZEOF))\r
+ return FALSE;\r
+\r
+ file = (struct cab_file *) calloc(1, sizeof(struct cab_file));\r
+ if (!file) { \r
+ ERR("out of memory!\n"); \r
+ return FALSE;\r
+ }\r
+ \r
+ file->length = EndGetI32(buf+cffile_UncompressedSize);\r
+ file->offset = EndGetI32(buf+cffile_FolderOffset);\r
+ file->index = EndGetI16(buf+cffile_FolderIndex);\r
+ file->time = EndGetI16(buf+cffile_Time);\r
+ file->date = EndGetI16(buf+cffile_Date);\r
+ file->attribs = EndGetI16(buf+cffile_Attribs);\r
+ file->filename = cabinet_read_string(cab);\r
+\r
+ if (!file->filename) {\r
+ free(file);\r
+ return FALSE;\r
+ }\r
+\r
+ if (!linkfile) \r
+ cab->files = file;\r
+ else \r
+ linkfile->next = file;\r
+\r
+ linkfile = file;\r
+ }\r
+ return TRUE;\r
+}\r
+\r
+/***********************************************************\r
+ * load_cab_offset (internal)\r
+ *\r
+ * validates and reads file entries from a cabinet at offset [offset] in\r
+ * file [name]. Returns a cabinet structure if successful, or NULL\r
+ * otherwise.\r
+ */\r
+struct cabinet *load_cab_offset(LPCSTR name, cab_off_t offset)\r
+{\r
+ struct cabinet *cab = (struct cabinet *) calloc(1, sizeof(struct cabinet));\r
+ int ok;\r
+\r
+ TRACE("(name == %s, offset == %u)\n", debugstr_a(name), offset);\r
+\r
+ if (!cab) return NULL;\r
+\r
+ cab->filename = name;\r
+ if ((ok = cabinet_open(cab))) {\r
+ cabinet_seek(cab, offset);\r
+ ok = cabinet_read_entries(cab);\r
+ cabinet_close(cab);\r
+ }\r
+\r
+ if (ok) return cab;\r
+ free(cab);\r
+ return NULL;\r
+}\r
+\r
+/* MSZIP decruncher */\r
+\r
+/* Dirk Stoecker wrote the ZIP decoder, based on the InfoZip deflate code */\r
+\r
+/********************************************************\r
+ * Ziphuft_free (internal)\r
+ */\r
+void Ziphuft_free(struct Ziphuft *t)\r
+{\r
+ register struct Ziphuft *p, *q;\r
+\r
+ /* Go through linked list, freeing from the allocated (t[-1]) address. */\r
+ p = t;\r
+ while (p != (struct Ziphuft *)NULL)\r
+ {\r
+ q = (--p)->v.t;\r
+ free(p);\r
+ p = q;\r
+ } \r
+}\r
+\r
+/*********************************************************\r
+ * Ziphuft_build (internal)\r
+ */\r
+cab_LONG Ziphuft_build(cab_ULONG *b, cab_ULONG n, cab_ULONG s, cab_UWORD *d, cab_UWORD *e,\r
+struct Ziphuft **t, cab_LONG *m, cab_decomp_state *decomp_state)\r
+{\r
+ cab_ULONG a; /* counter for codes of length k */\r
+ cab_ULONG el; /* length of EOB code (value 256) */\r
+ cab_ULONG f; /* i repeats in table every f entries */\r
+ cab_LONG g; /* maximum code length */\r
+ cab_LONG h; /* table level */\r
+ register cab_ULONG i; /* counter, current code */\r
+ register cab_ULONG j; /* counter */\r
+ register cab_LONG k; /* number of bits in current code */\r
+ cab_LONG *l; /* stack of bits per table */\r
+ register cab_ULONG *p; /* pointer into ZIP(c)[],ZIP(b)[],ZIP(v)[] */\r
+ register struct Ziphuft *q; /* points to current table */\r
+ struct Ziphuft r; /* table entry for structure assignment */\r
+ register cab_LONG w; /* bits before this table == (l * h) */\r
+ cab_ULONG *xp; /* pointer into x */\r
+ cab_LONG y; /* number of dummy codes added */\r
+ cab_ULONG z; /* number of entries in current table */\r
+\r
+ l = ZIP(lx)+1;\r
+\r
+ /* Generate counts for each bit length */\r
+ el = n > 256 ? b[256] : ZIPBMAX; /* set length of EOB code, if any */\r
+\r
+ for(i = 0; i < ZIPBMAX+1; ++i)\r
+ ZIP(c)[i] = 0;\r
+ p = b; i = n;\r
+ do\r
+ {\r
+ ZIP(c)[*p]++; p++; /* assume all entries <= ZIPBMAX */\r
+ } while (--i);\r
+ if (ZIP(c)[0] == n) /* null input--all zero length codes */\r
+ {\r
+ *t = (struct Ziphuft *)NULL;\r
+ *m = 0;\r
+ return 0;\r
+ }\r
+\r
+ /* Find minimum and maximum length, bound *m by those */\r
+ for (j = 1; j <= ZIPBMAX; j++)\r
+ if (ZIP(c)[j])\r
+ break;\r
+ k = j; /* minimum code length */\r
+ if ((cab_ULONG)*m < j)\r
+ *m = j;\r
+ for (i = ZIPBMAX; i; i--)\r
+ if (ZIP(c)[i])\r
+ break;\r
+ g = i; /* maximum code length */\r
+ if ((cab_ULONG)*m > i)\r
+ *m = i;\r
+\r
+ /* Adjust last length count to fill out codes, if needed */\r
+ for (y = 1 << j; j < i; j++, y <<= 1)\r
+ if ((y -= ZIP(c)[j]) < 0)\r
+ return 2; /* bad input: more codes than bits */\r
+ if ((y -= ZIP(c)[i]) < 0)\r
+ return 2;\r
+ ZIP(c)[i] += y;\r
+\r
+ /* Generate starting offsets LONGo the value table for each length */\r
+ ZIP(x)[1] = j = 0;\r
+ p = ZIP(c) + 1; xp = ZIP(x) + 2;\r
+ while (--i)\r
+ { /* note that i == g from above */\r
+ *xp++ = (j += *p++);\r
+ }\r
+\r
+ /* Make a table of values in order of bit lengths */\r
+ p = b; i = 0;\r
+ do{\r
+ if ((j = *p++) != 0)\r
+ ZIP(v)[ZIP(x)[j]++] = i;\r
+ } while (++i < n);\r
+\r
+\r
+ /* Generate the Huffman codes and for each, make the table entries */\r
+ ZIP(x)[0] = i = 0; /* first Huffman code is zero */\r
+ p = ZIP(v); /* grab values in bit order */\r
+ h = -1; /* no tables yet--level -1 */\r
+ w = l[-1] = 0; /* no bits decoded yet */\r
+ ZIP(u)[0] = (struct Ziphuft *)NULL; /* just to keep compilers happy */\r
+ q = (struct Ziphuft *)NULL; /* ditto */\r
+ z = 0; /* ditto */\r
+\r
+ /* go through the bit lengths (k already is bits in shortest code) */\r
+ for (; k <= g; k++)\r
+ {\r
+ a = ZIP(c)[k];\r
+ while (a--)\r
+ {\r
+ /* here i is the Huffman code of length k bits for value *p */\r
+ /* make tables up to required level */\r
+ while (k > w + l[h])\r
+ {\r
+ w += l[h++]; /* add bits already decoded */\r
+\r
+ /* compute minimum size table less than or equal to *m bits */\r
+ z = (z = g - w) > (cab_ULONG)*m ? *m : z; /* upper limit */\r
+ if ((f = 1 << (j = k - w)) > a + 1) /* try a k-w bit table */\r
+ { /* too few codes for k-w bit table */\r
+ f -= a + 1; /* deduct codes from patterns left */\r
+ xp = ZIP(c) + k;\r
+ while (++j < z) /* try smaller tables up to z bits */\r
+ {\r
+ if ((f <<= 1) <= *++xp)\r
+ break; /* enough codes to use up j bits */\r
+ f -= *xp; /* else deduct codes from patterns */\r
+ }\r
+ }\r
+ if ((cab_ULONG)w + j > el && (cab_ULONG)w < el)\r
+ j = el - w; /* make EOB code end at table */\r
+ z = 1 << j; /* table entries for j-bit table */\r
+ l[h] = j; /* set table size in stack */\r
+\r
+ /* allocate and link in new table */\r
+ if (!(q = (struct Ziphuft *) malloc((z + 1)*sizeof(struct Ziphuft))))\r
+ {\r
+ if(h)\r
+ Ziphuft_free(ZIP(u)[0]);\r
+ return 3; /* not enough memory */\r
+ }\r
+ *t = q + 1; /* link to list for Ziphuft_free() */\r
+ *(t = &(q->v.t)) = (struct Ziphuft *)NULL;\r
+ ZIP(u)[h] = ++q; /* table starts after link */\r
+\r
+ /* connect to last table, if there is one */\r
+ if (h)\r
+ {\r
+ ZIP(x)[h] = i; /* save pattern for backing up */\r
+ r.b = (cab_UBYTE)l[h-1]; /* bits to dump before this table */\r
+ r.e = (cab_UBYTE)(16 + j); /* bits in this table */\r
+ r.v.t = q; /* pointer to this table */\r
+ j = (i & ((1 << w) - 1)) >> (w - l[h-1]);\r
+ ZIP(u)[h-1][j] = r; /* connect to last table */\r
+ }\r
+ }\r
+\r
+ /* set up table entry in r */\r
+ r.b = (cab_UBYTE)(k - w);\r
+ if (p >= ZIP(v) + n)\r
+ r.e = 99; /* out of values--invalid code */\r
+ else if (*p < s)\r
+ {\r
+ r.e = (cab_UBYTE)(*p < 256 ? 16 : 15); /* 256 is end-of-block code */\r
+ r.v.n = *p++; /* simple code is just the value */\r
+ }\r
+ else\r
+ {\r
+ r.e = (cab_UBYTE)e[*p - s]; /* non-simple--look up in lists */\r
+ r.v.n = d[*p++ - s];\r
+ }\r
+\r
+ /* fill code-like entries with r */\r
+ f = 1 << (k - w);\r
+ for (j = i >> w; j < z; j += f)\r
+ q[j] = r;\r
+\r
+ /* backwards increment the k-bit code i */\r
+ for (j = 1 << (k - 1); i & j; j >>= 1)\r
+ i ^= j;\r
+ i ^= j;\r
+\r
+ /* backup over finished tables */\r
+ while ((i & ((1 << w) - 1)) != ZIP(x)[h])\r
+ w -= l[--h]; /* don't need to update q */\r
+ }\r
+ }\r
+\r
+ /* return actual size of base table */\r
+ *m = l[0];\r
+\r
+ /* Return true (1) if we were given an incomplete table */\r
+ return y != 0 && g != 1;\r
+}\r
+\r
+/*********************************************************\r
+ * Zipinflate_codes (internal)\r
+ */\r
+cab_LONG Zipinflate_codes(struct Ziphuft *tl, struct Ziphuft *td,\r
+ cab_LONG bl, cab_LONG bd, cab_decomp_state *decomp_state)\r
+{\r
+ register cab_ULONG e; /* table entry flag/number of extra bits */\r
+ cab_ULONG n, d; /* length and index for copy */\r
+ cab_ULONG w; /* current window position */\r
+ struct Ziphuft *t; /* pointer to table entry */\r
+ cab_ULONG ml, md; /* masks for bl and bd bits */\r
+ register cab_ULONG b; /* bit buffer */\r
+ register cab_ULONG k; /* number of bits in bit buffer */\r
+\r
+ /* make local copies of globals */\r
+ b = ZIP(bb); /* initialize bit buffer */\r
+ k = ZIP(bk);\r
+ w = ZIP(window_posn); /* initialize window position */\r
+\r
+ /* inflate the coded data */\r
+ ml = Zipmask[bl]; /* precompute masks for speed */\r
+ md = Zipmask[bd];\r
+\r
+ for(;;)\r
+ {\r
+ ZIPNEEDBITS((cab_ULONG)bl)\r
+ if((e = (t = tl + ((cab_ULONG)b & ml))->e) > 16)\r
+ do\r
+ {\r
+ if (e == 99)\r
+ return 1;\r
+ ZIPDUMPBITS(t->b)\r
+ e -= 16;\r
+ ZIPNEEDBITS(e)\r
+ } while ((e = (t = t->v.t + ((cab_ULONG)b & Zipmask[e]))->e) > 16);\r
+ ZIPDUMPBITS(t->b)\r
+ if (e == 16) /* then it's a literal */\r
+ CAB(outbuf)[w++] = (cab_UBYTE)t->v.n;\r
+ else /* it's an EOB or a length */\r
+ {\r
+ /* exit if end of block */\r
+ if(e == 15)\r
+ break;\r
+\r
+ /* get length of block to copy */\r
+ ZIPNEEDBITS(e)\r
+ n = t->v.n + ((cab_ULONG)b & Zipmask[e]);\r
+ ZIPDUMPBITS(e);\r
+\r
+ /* decode distance of block to copy */\r
+ ZIPNEEDBITS((cab_ULONG)bd)\r
+ if ((e = (t = td + ((cab_ULONG)b & md))->e) > 16)\r
+ do {\r
+ if (e == 99)\r
+ return 1;\r
+ ZIPDUMPBITS(t->b)\r
+ e -= 16;\r
+ ZIPNEEDBITS(e)\r
+ } while ((e = (t = t->v.t + ((cab_ULONG)b & Zipmask[e]))->e) > 16);\r
+ ZIPDUMPBITS(t->b)\r
+ ZIPNEEDBITS(e)\r
+ d = w - t->v.n - ((cab_ULONG)b & Zipmask[e]);\r
+ ZIPDUMPBITS(e)\r
+ do\r
+ {\r
+ n -= (e = (e = ZIPWSIZE - ((d &= ZIPWSIZE-1) > w ? d : w)) > n ?n:e);\r
+ do\r
+ {\r
+ CAB(outbuf)[w++] = CAB(outbuf)[d++];\r
+ } while (--e);\r
+ } while (n);\r
+ }\r
+ }\r
+\r
+ /* restore the globals from the locals */\r
+ ZIP(window_posn) = w; /* restore global window pointer */\r
+ ZIP(bb) = b; /* restore global bit buffer */\r
+ ZIP(bk) = k;\r
+\r
+ /* done */\r
+ return 0;\r
+}\r
+\r
+/***********************************************************\r
+ * Zipinflate_stored (internal)\r
+ */\r
+cab_LONG Zipinflate_stored(cab_decomp_state *decomp_state)\r
+/* "decompress" an inflated type 0 (stored) block. */\r
+{\r
+ cab_ULONG n; /* number of bytes in block */\r
+ cab_ULONG w; /* current window position */\r
+ register cab_ULONG b; /* bit buffer */\r
+ register cab_ULONG k; /* number of bits in bit buffer */\r
+\r
+ /* make local copies of globals */\r
+ b = ZIP(bb); /* initialize bit buffer */\r
+ k = ZIP(bk);\r
+ w = ZIP(window_posn); /* initialize window position */\r
+\r
+ /* go to byte boundary */\r
+ n = k & 7;\r
+ ZIPDUMPBITS(n);\r
+\r
+ /* get the length and its complement */\r
+ ZIPNEEDBITS(16)\r
+ n = ((cab_ULONG)b & 0xffff);\r
+ ZIPDUMPBITS(16)\r
+ ZIPNEEDBITS(16)\r
+ if (n != (cab_ULONG)((~b) & 0xffff))\r
+ return 1; /* error in compressed data */\r
+ ZIPDUMPBITS(16)\r
+\r
+ /* read and output the compressed data */\r
+ while(n--)\r
+ {\r
+ ZIPNEEDBITS(8)\r
+ CAB(outbuf)[w++] = (cab_UBYTE)b;\r
+ ZIPDUMPBITS(8)\r
+ }\r
+\r
+ /* restore the globals from the locals */\r
+ ZIP(window_posn) = w; /* restore global window pointer */\r
+ ZIP(bb) = b; /* restore global bit buffer */\r
+ ZIP(bk) = k;\r
+ return 0;\r
+}\r
+\r
+/******************************************************\r
+ * Zipinflate_fixed (internal)\r
+ */\r
+cab_LONG Zipinflate_fixed(cab_decomp_state *decomp_state)\r
+{\r
+ struct Ziphuft *fixed_tl;\r
+ struct Ziphuft *fixed_td;\r
+ cab_LONG fixed_bl, fixed_bd;\r
+ cab_LONG i; /* temporary variable */\r
+ cab_ULONG *l;\r
+\r
+ l = ZIP(ll);\r
+\r
+ /* literal table */\r
+ for(i = 0; i < 144; i++)\r
+ l[i] = 8;\r
+ for(; i < 256; i++)\r
+ l[i] = 9;\r
+ for(; i < 280; i++)\r
+ l[i] = 7;\r
+ for(; i < 288; i++) /* make a complete, but wrong code set */\r
+ l[i] = 8;\r
+ fixed_bl = 7;\r
+ if((i = Ziphuft_build(l, 288, 257, (cab_UWORD *) Zipcplens,\r
+ (cab_UWORD *) Zipcplext, &fixed_tl, &fixed_bl, decomp_state)))\r
+ return i;\r
+\r
+ /* distance table */\r
+ for(i = 0; i < 30; i++) /* make an incomplete code set */\r
+ l[i] = 5;\r
+ fixed_bd = 5;\r
+ if((i = Ziphuft_build(l, 30, 0, (cab_UWORD *) Zipcpdist, (cab_UWORD *) Zipcpdext,\r
+ &fixed_td, &fixed_bd, decomp_state)) > 1)\r
+ {\r
+ Ziphuft_free(fixed_tl);\r
+ return i;\r
+ }\r
+\r
+ /* decompress until an end-of-block code */\r
+ i = Zipinflate_codes(fixed_tl, fixed_td, fixed_bl, fixed_bd, decomp_state);\r
+\r
+ Ziphuft_free(fixed_td);\r
+ Ziphuft_free(fixed_tl);\r
+ return i;\r
+}\r
+\r
+/**************************************************************\r
+ * Zipinflate_dynamic (internal)\r
+ */\r
+cab_LONG Zipinflate_dynamic(cab_decomp_state *decomp_state)\r
+ /* decompress an inflated type 2 (dynamic Huffman codes) block. */\r
+{\r
+ cab_LONG i; /* temporary variables */\r
+ cab_ULONG j;\r
+ cab_ULONG *ll;\r
+ cab_ULONG l; /* last length */\r
+ cab_ULONG m; /* mask for bit lengths table */\r
+ cab_ULONG n; /* number of lengths to get */\r
+ struct Ziphuft *tl; /* literal/length code table */\r
+ struct Ziphuft *td; /* distance code table */\r
+ cab_LONG bl; /* lookup bits for tl */\r
+ cab_LONG bd; /* lookup bits for td */\r
+ cab_ULONG nb; /* number of bit length codes */\r
+ cab_ULONG nl; /* number of literal/length codes */\r
+ cab_ULONG nd; /* number of distance codes */\r
+ register cab_ULONG b; /* bit buffer */\r
+ register cab_ULONG k; /* number of bits in bit buffer */\r
+\r
+ /* make local bit buffer */\r
+ b = ZIP(bb);\r
+ k = ZIP(bk);\r
+ ll = ZIP(ll);\r
+\r
+ /* read in table lengths */\r
+ ZIPNEEDBITS(5)\r
+ nl = 257 + ((cab_ULONG)b & 0x1f); /* number of literal/length codes */\r
+ ZIPDUMPBITS(5)\r
+ ZIPNEEDBITS(5)\r
+ nd = 1 + ((cab_ULONG)b & 0x1f); /* number of distance codes */\r
+ ZIPDUMPBITS(5)\r
+ ZIPNEEDBITS(4)\r
+ nb = 4 + ((cab_ULONG)b & 0xf); /* number of bit length codes */\r
+ ZIPDUMPBITS(4)\r
+ if(nl > 288 || nd > 32)\r
+ return 1; /* bad lengths */\r
+\r
+ /* read in bit-length-code lengths */\r
+ for(j = 0; j < nb; j++)\r
+ {\r
+ ZIPNEEDBITS(3)\r
+ ll[Zipborder[j]] = (cab_ULONG)b & 7;\r
+ ZIPDUMPBITS(3)\r
+ }\r
+ for(; j < 19; j++)\r
+ ll[Zipborder[j]] = 0;\r
+\r
+ /* build decoding table for trees--single level, 7 bit lookup */\r
+ bl = 7;\r
+ if((i = Ziphuft_build(ll, 19, 19, NULL, NULL, &tl, &bl, decomp_state)) != 0)\r
+ {\r
+ if(i == 1)\r
+ Ziphuft_free(tl);\r
+ return i; /* incomplete code set */\r
+ }\r
+\r
+ /* read in literal and distance code lengths */\r
+ n = nl + nd;\r
+ m = Zipmask[bl];\r
+ i = l = 0;\r
+ while((cab_ULONG)i < n)\r
+ {\r
+ ZIPNEEDBITS((cab_ULONG)bl)\r
+ j = (td = tl + ((cab_ULONG)b & m))->b;\r
+ ZIPDUMPBITS(j)\r
+ j = td->v.n;\r
+ if (j < 16) /* length of code in bits (0..15) */\r
+ ll[i++] = l = j; /* save last length in l */\r
+ else if (j == 16) /* repeat last length 3 to 6 times */\r
+ {\r
+ ZIPNEEDBITS(2)\r
+ j = 3 + ((cab_ULONG)b & 3);\r
+ ZIPDUMPBITS(2)\r
+ if((cab_ULONG)i + j > n)\r
+ return 1;\r
+ while (j--)\r
+ ll[i++] = l;\r
+ }\r
+ else if (j == 17) /* 3 to 10 zero length codes */\r
+ {\r
+ ZIPNEEDBITS(3)\r
+ j = 3 + ((cab_ULONG)b & 7);\r
+ ZIPDUMPBITS(3)\r
+ if ((cab_ULONG)i + j > n)\r
+ return 1;\r
+ while (j--)\r
+ ll[i++] = 0;\r
+ l = 0;\r
+ }\r
+ else /* j == 18: 11 to 138 zero length codes */\r
+ {\r
+ ZIPNEEDBITS(7)\r
+ j = 11 + ((cab_ULONG)b & 0x7f);\r
+ ZIPDUMPBITS(7)\r
+ if ((cab_ULONG)i + j > n)\r
+ return 1;\r
+ while (j--)\r
+ ll[i++] = 0;\r
+ l = 0;\r
+ }\r
+ }\r
+\r
+ /* free decoding table for trees */\r
+ Ziphuft_free(tl);\r
+\r
+ /* restore the global bit buffer */\r
+ ZIP(bb) = b;\r
+ ZIP(bk) = k;\r
+\r
+ /* build the decoding tables for literal/length and distance codes */\r
+ bl = ZIPLBITS;\r
+ if((i = Ziphuft_build(ll, nl, 257, (cab_UWORD *) Zipcplens, (cab_UWORD *) Zipcplext,\r
+ &tl, &bl, decomp_state)) != 0)\r
+ {\r
+ if(i == 1)\r
+ Ziphuft_free(tl);\r
+ return i; /* incomplete code set */\r
+ }\r
+ bd = ZIPDBITS;\r
+ Ziphuft_build(ll + nl, nd, 0, (cab_UWORD *) Zipcpdist, (cab_UWORD *) Zipcpdext,\r
+ &td, &bd, decomp_state);\r
+\r
+ /* decompress until an end-of-block code */\r
+ if(Zipinflate_codes(tl, td, bl, bd, decomp_state))\r
+ return 1;\r
+\r
+ /* free the decoding tables, return */\r
+ Ziphuft_free(tl);\r
+ Ziphuft_free(td);\r
+ return 0;\r
+}\r
+\r
+/*****************************************************\r
+ * Zipinflate_block (internal)\r
+ */\r
+cab_LONG Zipinflate_block(cab_LONG *e, cab_decomp_state *decomp_state) /* e == last block flag */\r
+{ /* decompress an inflated block */\r
+ cab_ULONG t; /* block type */\r
+ register cab_ULONG b; /* bit buffer */\r
+ register cab_ULONG k; /* number of bits in bit buffer */\r
+\r
+ /* make local bit buffer */\r
+ b = ZIP(bb);\r
+ k = ZIP(bk);\r
+\r
+ /* read in last block bit */\r
+ ZIPNEEDBITS(1)\r
+ *e = (cab_LONG)b & 1;\r
+ ZIPDUMPBITS(1)\r
+\r
+ /* read in block type */\r
+ ZIPNEEDBITS(2)\r
+ t = (cab_ULONG)b & 3;\r
+ ZIPDUMPBITS(2)\r
+\r
+ /* restore the global bit buffer */\r
+ ZIP(bb) = b;\r
+ ZIP(bk) = k;\r
+\r
+ /* inflate that block type */\r
+ if(t == 2)\r
+ return Zipinflate_dynamic(decomp_state);\r
+ if(t == 0)\r
+ return Zipinflate_stored(decomp_state);\r
+ if(t == 1)\r
+ return Zipinflate_fixed(decomp_state);\r
+ /* bad block type */\r
+ return 2;\r
+}\r
+\r
+/****************************************************\r
+ * ZIPdecompress (internal)\r
+ */\r
+int ZIPdecompress(int inlen, int outlen, cab_decomp_state *decomp_state)\r
+{\r
+ cab_LONG e; /* last block flag */\r
+\r
+ TRACE("(inlen == %d, outlen == %d)\n", inlen, outlen);\r
+\r
+ ZIP(inpos) = CAB(inbuf);\r
+ ZIP(bb) = ZIP(bk) = ZIP(window_posn) = 0;\r
+ if(outlen > ZIPWSIZE)\r
+ return DECR_DATAFORMAT;\r
+\r
+ /* CK = Chris Kirmse, official Microsoft purloiner */\r
+ if(ZIP(inpos)[0] != 0x43 || ZIP(inpos)[1] != 0x4B)\r
+ return DECR_ILLEGALDATA;\r
+ ZIP(inpos) += 2;\r
+\r
+ do\r
+ {\r
+ if(Zipinflate_block(&e, decomp_state))\r
+ return DECR_ILLEGALDATA;\r
+ } while(!e);\r
+\r
+ /* return success */\r
+ return DECR_OK;\r
+}\r
+\r
+/* Quantum decruncher */\r
+\r
+/* This decruncher was researched and implemented by Matthew Russoto. */\r
+/* It has since been tidied up by Stuart Caie */\r
+\r
+/******************************************************************\r
+ * QTMinitmodel (internal)\r
+ *\r
+ * Initialise a model which decodes symbols from [s] to [s]+[n]-1\r
+ */\r
+void QTMinitmodel(struct QTMmodel *m, struct QTMmodelsym *sym, int n, int s) {\r
+ int i;\r
+ m->shiftsleft = 4;\r
+ m->entries = n;\r
+ m->syms = sym;\r
+ memset(m->tabloc, 0xFF, sizeof(m->tabloc)); /* clear out look-up table */\r
+ for (i = 0; i < n; i++) {\r
+ m->tabloc[i+s] = i; /* set up a look-up entry for symbol */\r
+ m->syms[i].sym = i+s; /* actual symbol */\r
+ m->syms[i].cumfreq = n-i; /* current frequency of that symbol */\r
+ }\r
+ m->syms[n].cumfreq = 0;\r
+}\r
+\r
+/******************************************************************\r
+ * QTMinit (internal)\r
+ */\r
+int QTMinit(int window, int level, cab_decomp_state *decomp_state) {\r
+ unsigned int wndsize = 1 << window;\r
+ int msz = window * 2, i;\r
+ cab_ULONG j;\r
+\r
+ /* QTM supports window sizes of 2^10 (1Kb) through 2^21 (2Mb) */\r
+ /* if a previously allocated window is big enough, keep it */\r
+ if (window < 10 || window > 21) return DECR_DATAFORMAT;\r
+ if (QTM(actual_size) < wndsize) {\r
+ if (QTM(window)) free(QTM(window));\r
+ QTM(window) = NULL;\r
+ }\r
+ if (!QTM(window)) {\r
+ if (!(QTM(window) = malloc(wndsize))) return DECR_NOMEMORY;\r
+ QTM(actual_size) = wndsize;\r
+ }\r
+ QTM(window_size) = wndsize;\r
+ QTM(window_posn) = 0;\r
+\r
+ /* initialise static slot/extrabits tables */\r
+ for (i = 0, j = 0; i < 27; i++) {\r
+ CAB(q_length_extra)[i] = (i == 26) ? 0 : (i < 2 ? 0 : i - 2) >> 2;\r
+ CAB(q_length_base)[i] = j; j += 1 << ((i == 26) ? 5 : CAB(q_length_extra)[i]);\r
+ }\r
+ for (i = 0, j = 0; i < 42; i++) {\r
+ CAB(q_extra_bits)[i] = (i < 2 ? 0 : i-2) >> 1;\r
+ CAB(q_position_base)[i] = j; j += 1 << CAB(q_extra_bits)[i];\r
+ }\r
+\r
+ /* initialise arithmetic coding models */\r
+\r
+ QTMinitmodel(&QTM(model7), &QTM(m7sym)[0], 7, 0);\r
+\r
+ QTMinitmodel(&QTM(model00), &QTM(m00sym)[0], 0x40, 0x00);\r
+ QTMinitmodel(&QTM(model40), &QTM(m40sym)[0], 0x40, 0x40);\r
+ QTMinitmodel(&QTM(model80), &QTM(m80sym)[0], 0x40, 0x80);\r
+ QTMinitmodel(&QTM(modelC0), &QTM(mC0sym)[0], 0x40, 0xC0);\r
+\r
+ /* model 4 depends on table size, ranges from 20 to 24 */\r
+ QTMinitmodel(&QTM(model4), &QTM(m4sym)[0], (msz < 24) ? msz : 24, 0);\r
+ /* model 5 depends on table size, ranges from 20 to 36 */\r
+ QTMinitmodel(&QTM(model5), &QTM(m5sym)[0], (msz < 36) ? msz : 36, 0);\r
+ /* model 6pos depends on table size, ranges from 20 to 42 */\r
+ QTMinitmodel(&QTM(model6pos), &QTM(m6psym)[0], msz, 0);\r
+ QTMinitmodel(&QTM(model6len), &QTM(m6lsym)[0], 27, 0);\r
+\r
+ return DECR_OK;\r
+}\r
+\r
+/****************************************************************\r
+ * QTMupdatemodel (internal)\r
+ */\r
+void QTMupdatemodel(struct QTMmodel *model, int sym) {\r
+ struct QTMmodelsym temp;\r
+ int i, j;\r
+\r
+ for (i = 0; i < sym; i++) model->syms[i].cumfreq += 8;\r
+\r
+ if (model->syms[0].cumfreq > 3800) {\r
+ if (--model->shiftsleft) {\r
+ for (i = model->entries - 1; i >= 0; i--) {\r
+ /* -1, not -2; the 0 entry saves this */\r
+ model->syms[i].cumfreq >>= 1;\r
+ if (model->syms[i].cumfreq <= model->syms[i+1].cumfreq) {\r
+ model->syms[i].cumfreq = model->syms[i+1].cumfreq + 1;\r
+ }\r
+ }\r
+ }\r
+ else {\r
+ model->shiftsleft = 50;\r
+ for (i = 0; i < model->entries ; i++) {\r
+ /* no -1, want to include the 0 entry */\r
+ /* this converts cumfreqs into frequencies, then shifts right */\r
+ model->syms[i].cumfreq -= model->syms[i+1].cumfreq;\r
+ model->syms[i].cumfreq++; /* avoid losing things entirely */\r
+ model->syms[i].cumfreq >>= 1;\r
+ }\r
+\r
+ /* now sort by frequencies, decreasing order -- this must be an\r
+ * inplace selection sort, or a sort with the same (in)stability\r
+ * characteristics\r
+ */\r
+ for (i = 0; i < model->entries - 1; i++) {\r
+ for (j = i + 1; j < model->entries; j++) {\r
+ if (model->syms[i].cumfreq < model->syms[j].cumfreq) {\r
+ temp = model->syms[i];\r
+ model->syms[i] = model->syms[j];\r
+ model->syms[j] = temp;\r
+ }\r
+ }\r
+ }\r
+ \r
+ /* then convert frequencies back to cumfreq */\r
+ for (i = model->entries - 1; i >= 0; i--) {\r
+ model->syms[i].cumfreq += model->syms[i+1].cumfreq;\r
+ }\r
+ /* then update the other part of the table */\r
+ for (i = 0; i < model->entries; i++) {\r
+ model->tabloc[model->syms[i].sym] = i;\r
+ }\r
+ }\r
+ }\r
+}\r
+\r
+/*******************************************************************\r
+ * QTMdecompress (internal)\r
+ */\r
+int QTMdecompress(int inlen, int outlen, cab_decomp_state *decomp_state)\r
+{\r
+ cab_UBYTE *inpos = CAB(inbuf);\r
+ cab_UBYTE *window = QTM(window);\r
+ cab_UBYTE *runsrc, *rundest;\r
+\r
+ cab_ULONG window_posn = QTM(window_posn);\r
+ cab_ULONG window_size = QTM(window_size);\r
+\r
+ /* used by bitstream macros */\r
+ register int bitsleft, bitrun, bitsneed;\r
+ register cab_ULONG bitbuf;\r
+\r
+ /* used by GET_SYMBOL */\r
+ cab_ULONG range;\r
+ cab_UWORD symf;\r
+ int i;\r
+\r
+ int extra, togo = outlen, match_length = 0, copy_length;\r
+ cab_UBYTE selector, sym;\r
+ cab_ULONG match_offset = 0;\r
+\r
+ cab_UWORD H = 0xFFFF, L = 0, C;\r
+\r
+ TRACE("(inlen == %d, outlen == %d)\n", inlen, outlen);\r
+\r
+ /* read initial value of C */\r
+ Q_INIT_BITSTREAM;\r
+ Q_READ_BITS(C, 16);\r
+\r
+ /* apply 2^x-1 mask */\r
+ window_posn &= window_size - 1;\r
+ /* runs can't straddle the window wraparound */\r
+ if ((window_posn + togo) > window_size) {\r
+ TRACE("straddled run\n");\r
+ return DECR_DATAFORMAT;\r
+ }\r
+\r
+ while (togo > 0) {\r
+ GET_SYMBOL(model7, selector);\r
+ switch (selector) {\r
+ case 0:\r
+ GET_SYMBOL(model00, sym); window[window_posn++] = sym; togo--;\r
+ break;\r
+ case 1:\r
+ GET_SYMBOL(model40, sym); window[window_posn++] = sym; togo--;\r
+ break;\r
+ case 2:\r
+ GET_SYMBOL(model80, sym); window[window_posn++] = sym; togo--;\r
+ break;\r
+ case 3:\r
+ GET_SYMBOL(modelC0, sym); window[window_posn++] = sym; togo--;\r
+ break;\r
+\r
+ case 4:\r
+ /* selector 4 = fixed length of 3 */\r
+ GET_SYMBOL(model4, sym);\r
+ Q_READ_BITS(extra, CAB(q_extra_bits)[sym]);\r
+ match_offset = CAB(q_position_base)[sym] + extra + 1;\r
+ match_length = 3;\r
+ break;\r
+\r
+ case 5:\r
+ /* selector 5 = fixed length of 4 */\r
+ GET_SYMBOL(model5, sym);\r
+ Q_READ_BITS(extra, CAB(q_extra_bits)[sym]);\r
+ match_offset = CAB(q_position_base)[sym] + extra + 1;\r
+ match_length = 4;\r
+ break;\r
+\r
+ case 6:\r
+ /* selector 6 = variable length */\r
+ GET_SYMBOL(model6len, sym);\r
+ Q_READ_BITS(extra, CAB(q_length_extra)[sym]);\r
+ match_length = CAB(q_length_base)[sym] + extra + 5;\r
+ GET_SYMBOL(model6pos, sym);\r
+ Q_READ_BITS(extra, CAB(q_extra_bits)[sym]);\r
+ match_offset = CAB(q_position_base)[sym] + extra + 1;\r
+ break;\r
+\r
+ default:\r
+ TRACE("Selector is bogus\n");\r
+ return DECR_ILLEGALDATA;\r
+ }\r
+\r
+ /* if this is a match */\r
+ if (selector >= 4) {\r
+ rundest = window + window_posn;\r
+ togo -= match_length;\r
+\r
+ /* copy any wrapped around source data */\r
+ if (window_posn >= match_offset) {\r
+ /* no wrap */\r
+ runsrc = rundest - match_offset;\r
+ } else {\r
+ runsrc = rundest + (window_size - match_offset);\r
+ copy_length = match_offset - window_posn;\r
+ if (copy_length < match_length) {\r
+ match_length -= copy_length;\r
+ window_posn += copy_length;\r
+ while (copy_length-- > 0) *rundest++ = *runsrc++;\r
+ runsrc = window;\r
+ }\r
+ }\r
+ window_posn += match_length;\r
+\r
+ /* copy match data - no worries about destination wraps */\r
+ while (match_length-- > 0) *rundest++ = *runsrc++;\r
+ }\r
+ } /* while (togo > 0) */\r
+\r
+ if (togo != 0) {\r
+ TRACE("Frame overflow, this_run = %d\n", togo);\r
+ return DECR_ILLEGALDATA;\r
+ }\r
+\r
+ memcpy(CAB(outbuf), window + ((!window_posn) ? window_size : window_posn) -\r
+ outlen, outlen);\r
+\r
+ QTM(window_posn) = window_posn;\r
+ return DECR_OK;\r
+}\r
+\r
+/* LZX decruncher */\r
+\r
+/* Microsoft's LZX document and their implementation of the\r
+ * com.ms.util.cab Java package do not concur.\r
+ *\r
+ * In the LZX document, there is a table showing the correlation between\r
+ * window size and the number of position slots. It states that the 1MB\r
+ * window = 40 slots and the 2MB window = 42 slots. In the implementation,\r
+ * 1MB = 42 slots, 2MB = 50 slots. The actual calculation is 'find the\r
+ * first slot whose position base is equal to or more than the required\r
+ * window size'. This would explain why other tables in the document refer\r
+ * to 50 slots rather than 42.\r
+ *\r
+ * The constant NUM_PRIMARY_LENGTHS used in the decompression pseudocode\r
+ * is not defined in the specification.\r
+ *\r
+ * The LZX document does not state the uncompressed block has an\r
+ * uncompressed length field. Where does this length field come from, so\r
+ * we can know how large the block is? The implementation has it as the 24\r
+ * bits following after the 3 blocktype bits, before the alignment\r
+ * padding.\r
+ *\r
+ * The LZX document states that aligned offset blocks have their aligned\r
+ * offset huffman tree AFTER the main and length trees. The implementation\r
+ * suggests that the aligned offset tree is BEFORE the main and length\r
+ * trees.\r
+ *\r
+ * The LZX document decoding algorithm states that, in an aligned offset\r
+ * block, if an extra_bits value is 1, 2 or 3, then that number of bits\r
+ * should be read and the result added to the match offset. This is\r
+ * correct for 1 and 2, but not 3, where just a huffman symbol (using the\r
+ * aligned tree) should be read.\r
+ *\r
+ * Regarding the E8 preprocessing, the LZX document states 'No translation\r
+ * may be performed on the last 6 bytes of the input block'. This is\r
+ * correct. However, the pseudocode provided checks for the *E8 leader*\r
+ * up to the last 6 bytes. If the leader appears between -10 and -7 bytes\r
+ * from the end, this would cause the next four bytes to be modified, at\r
+ * least one of which would be in the last 6 bytes, which is not allowed\r
+ * according to the spec.\r
+ *\r
+ * The specification states that the huffman trees must always contain at\r
+ * least one element. However, many CAB files contain blocks where the\r
+ * length tree is completely empty (because there are no matches), and\r
+ * this is expected to succeed.\r
+ */\r
+\r
+\r
+/* LZX uses what it calls 'position slots' to represent match offsets.\r
+ * What this means is that a small 'position slot' number and a small\r
+ * offset from that slot are encoded instead of one large offset for\r
+ * every match.\r
+ * - lzx_position_base is an index to the position slot bases\r
+ * - lzx_extra_bits states how many bits of offset-from-base data is needed.\r
+ */\r
+\r
+/************************************************************\r
+ * LZXinit (internal)\r
+ */\r
+int LZXinit(int window, cab_decomp_state *decomp_state) {\r
+ cab_ULONG wndsize = 1 << window;\r
+ int i, j, posn_slots;\r
+\r
+ /* LZX supports window sizes of 2^15 (32Kb) through 2^21 (2Mb) */\r
+ /* if a previously allocated window is big enough, keep it */\r
+ if (window < 15 || window > 21) return DECR_DATAFORMAT;\r
+ if (LZX(actual_size) < wndsize) {\r
+ if (LZX(window)) free(LZX(window));\r
+ LZX(window) = NULL;\r
+ }\r
+ if (!LZX(window)) {\r
+ if (!(LZX(window) = malloc(wndsize))) return DECR_NOMEMORY;\r
+ LZX(actual_size) = wndsize;\r
+ }\r
+ LZX(window_size) = wndsize;\r
+\r
+ /* initialise static tables */\r
+ for (i=0, j=0; i <= 50; i += 2) {\r
+ CAB(extra_bits)[i] = CAB(extra_bits)[i+1] = j; /* 0,0,0,0,1,1,2,2,3,3... */\r
+ if ((i != 0) && (j < 17)) j++; /* 0,0,1,2,3,4...15,16,17,17,17,17... */\r
+ }\r
+ for (i=0, j=0; i <= 50; i++) {\r
+ CAB(lzx_position_base)[i] = j; /* 0,1,2,3,4,6,8,12,16,24,32,... */\r
+ j += 1 << CAB(extra_bits)[i]; /* 1,1,1,1,2,2,4,4,8,8,16,16,32,32,... */\r
+ }\r
+\r
+ /* calculate required position slots */\r
+ if (window == 20) posn_slots = 42;\r
+ else if (window == 21) posn_slots = 50;\r
+ else posn_slots = window << 1;\r
+\r
+ /*posn_slots=i=0; while (i < wndsize) i += 1 << CAB(extra_bits)[posn_slots++]; */\r
+\r
+ LZX(R0) = LZX(R1) = LZX(R2) = 1;\r
+ LZX(main_elements) = LZX_NUM_CHARS + (posn_slots << 3);\r
+ LZX(header_read) = 0;\r
+ LZX(frames_read) = 0;\r
+ LZX(block_remaining) = 0;\r
+ LZX(block_type) = LZX_BLOCKTYPE_INVALID;\r
+ LZX(intel_curpos) = 0;\r
+ LZX(intel_started) = 0;\r
+ LZX(window_posn) = 0;\r
+\r
+ /* initialise tables to 0 (because deltas will be applied to them) */\r
+ for (i = 0; i < LZX_MAINTREE_MAXSYMBOLS; i++) LZX(MAINTREE_len)[i] = 0;\r
+ for (i = 0; i < LZX_LENGTH_MAXSYMBOLS; i++) LZX(LENGTH_len)[i] = 0;\r
+\r
+ return DECR_OK;\r
+}\r
+\r
+/*************************************************************************\r
+ * make_decode_table (internal)\r
+ *\r
+ * This function was coded by David Tritscher. It builds a fast huffman\r
+ * decoding table out of just a canonical huffman code lengths table.\r
+ *\r
+ * PARAMS\r
+ * nsyms: total number of symbols in this huffman tree.\r
+ * nbits: any symbols with a code length of nbits or less can be decoded\r
+ * in one lookup of the table.\r
+ * length: A table to get code lengths from [0 to syms-1]\r
+ * table: The table to fill up with decoded symbols and pointers.\r
+ *\r
+ * RETURNS\r
+ * OK: 0\r
+ * error: 1\r
+ */\r
+int make_decode_table(cab_ULONG nsyms, cab_ULONG nbits, cab_UBYTE *length, cab_UWORD *table) {\r
+ register cab_UWORD sym;\r
+ register cab_ULONG leaf;\r
+ register cab_UBYTE bit_num = 1;\r
+ cab_ULONG fill;\r
+ cab_ULONG pos = 0; /* the current position in the decode table */\r
+ cab_ULONG table_mask = 1 << nbits;\r
+ cab_ULONG bit_mask = table_mask >> 1; /* don't do 0 length codes */\r
+ cab_ULONG next_symbol = bit_mask; /* base of allocation for long codes */\r
+\r
+ /* fill entries for codes short enough for a direct mapping */\r
+ while (bit_num <= nbits) {\r
+ for (sym = 0; sym < nsyms; sym++) {\r
+ if (length[sym] == bit_num) {\r
+ leaf = pos;\r
+\r
+ if((pos += bit_mask) > table_mask) return 1; /* table overrun */\r
+\r
+ /* fill all possible lookups of this symbol with the symbol itself */\r
+ fill = bit_mask;\r
+ while (fill-- > 0) table[leaf++] = sym;\r
+ }\r
+ }\r
+ bit_mask >>= 1;\r
+ bit_num++;\r
+ }\r
+\r
+ /* if there are any codes longer than nbits */\r
+ if (pos != table_mask) {\r
+ /* clear the remainder of the table */\r
+ for (sym = pos; sym < table_mask; sym++) table[sym] = 0;\r
+\r
+ /* give ourselves room for codes to grow by up to 16 more bits */\r
+ pos <<= 16;\r
+ table_mask <<= 16;\r
+ bit_mask = 1 << 15;\r
+\r
+ while (bit_num <= 16) {\r
+ for (sym = 0; sym < nsyms; sym++) {\r
+ if (length[sym] == bit_num) {\r
+ leaf = pos >> 16;\r
+ for (fill = 0; fill < bit_num - nbits; fill++) {\r
+ /* if this path hasn't been taken yet, 'allocate' two entries */\r
+ if (table[leaf] == 0) {\r
+ table[(next_symbol << 1)] = 0;\r
+ table[(next_symbol << 1) + 1] = 0;\r
+ table[leaf] = next_symbol++;\r
+ }\r
+ /* follow the path and select either left or right for next bit */\r
+ leaf = table[leaf] << 1;\r
+ if ((pos >> (15-fill)) & 1) leaf++;\r
+ }\r
+ table[leaf] = sym;\r
+\r
+ if ((pos += bit_mask) > table_mask) return 1; /* table overflow */\r
+ }\r
+ }\r
+ bit_mask >>= 1;\r
+ bit_num++;\r
+ }\r
+ }\r
+\r
+ /* full table? */\r
+ if (pos == table_mask) return 0;\r
+\r
+ /* either erroneous table, or all elements are 0 - let's find out. */\r
+ for (sym = 0; sym < nsyms; sym++) if (length[sym]) return 1;\r
+ return 0;\r
+}\r
+\r
+/************************************************************\r
+ * lzx_read_lens (internal)\r
+ */\r
+int lzx_read_lens(cab_UBYTE *lens, cab_ULONG first, cab_ULONG last, struct lzx_bits *lb,\r
+ cab_decomp_state *decomp_state) {\r
+ cab_ULONG i,j, x,y;\r
+ int z;\r
+\r
+ register cab_ULONG bitbuf = lb->bb;\r
+ register int bitsleft = lb->bl;\r
+ cab_UBYTE *inpos = lb->ip;\r
+ cab_UWORD *hufftbl;\r
+ \r
+ for (x = 0; x < 20; x++) {\r
+ READ_BITS(y, 4);\r
+ LENTABLE(PRETREE)[x] = y;\r
+ }\r
+ BUILD_TABLE(PRETREE);\r
+\r
+ for (x = first; x < last; ) {\r
+ READ_HUFFSYM(PRETREE, z);\r
+ if (z == 17) {\r
+ READ_BITS(y, 4); y += 4;\r
+ while (y--) lens[x++] = 0;\r
+ }\r
+ else if (z == 18) {\r
+ READ_BITS(y, 5); y += 20;\r
+ while (y--) lens[x++] = 0;\r
+ }\r
+ else if (z == 19) {\r
+ READ_BITS(y, 1); y += 4;\r
+ READ_HUFFSYM(PRETREE, z);\r
+ z = lens[x] - z; if (z < 0) z += 17;\r
+ while (y--) lens[x++] = z;\r
+ }\r
+ else {\r
+ z = lens[x] - z; if (z < 0) z += 17;\r
+ lens[x++] = z;\r
+ }\r
+ }\r
+\r
+ lb->bb = bitbuf;\r
+ lb->bl = bitsleft;\r
+ lb->ip = inpos;\r
+ return 0;\r
+}\r
+\r
+/*******************************************************\r
+ * LZXdecompress (internal)\r
+ */\r
+int LZXdecompress(int inlen, int outlen, cab_decomp_state *decomp_state) {\r
+ cab_UBYTE *inpos = CAB(inbuf);\r
+ cab_UBYTE *endinp = inpos + inlen;\r
+ cab_UBYTE *window = LZX(window);\r
+ cab_UBYTE *runsrc, *rundest;\r
+ cab_UWORD *hufftbl; /* used in READ_HUFFSYM macro as chosen decoding table */\r
+\r
+ cab_ULONG window_posn = LZX(window_posn);\r
+ cab_ULONG window_size = LZX(window_size);\r
+ cab_ULONG R0 = LZX(R0);\r
+ cab_ULONG R1 = LZX(R1);\r
+ cab_ULONG R2 = LZX(R2);\r
+\r
+ register cab_ULONG bitbuf;\r
+ register int bitsleft;\r
+ cab_ULONG match_offset, i,j,k; /* ijk used in READ_HUFFSYM macro */\r
+ struct lzx_bits lb; /* used in READ_LENGTHS macro */\r
+\r
+ int togo = outlen, this_run, main_element, aligned_bits;\r
+ int match_length, copy_length, length_footer, extra, verbatim_bits;\r
+\r
+ TRACE("(inlen == %d, outlen == %d)\n", inlen, outlen);\r
+\r
+ INIT_BITSTREAM;\r
+\r
+ /* read header if necessary */\r
+ if (!LZX(header_read)) {\r
+ i = j = 0;\r
+ READ_BITS(k, 1); if (k) { READ_BITS(i,16); READ_BITS(j,16); }\r
+ LZX(intel_filesize) = (i << 16) | j; /* or 0 if not encoded */\r
+ LZX(header_read) = 1;\r
+ }\r
+\r
+ /* main decoding loop */\r
+ while (togo > 0) {\r
+ /* last block finished, new block expected */\r
+ if (LZX(block_remaining) == 0) {\r
+ if (LZX(block_type) == LZX_BLOCKTYPE_UNCOMPRESSED) {\r
+ if (LZX(block_length) & 1) inpos++; /* realign bitstream to word */\r
+ INIT_BITSTREAM;\r
+ }\r
+\r
+ READ_BITS(LZX(block_type), 3);\r
+ READ_BITS(i, 16);\r
+ READ_BITS(j, 8);\r
+ LZX(block_remaining) = LZX(block_length) = (i << 8) | j;\r
+\r
+ switch (LZX(block_type)) {\r
+ case LZX_BLOCKTYPE_ALIGNED:\r
+ for (i = 0; i < 8; i++) { READ_BITS(j, 3); LENTABLE(ALIGNED)[i] = j; }\r
+ BUILD_TABLE(ALIGNED);\r
+ /* rest of aligned header is same as verbatim */\r
+\r
+ case LZX_BLOCKTYPE_VERBATIM:\r
+ READ_LENGTHS(MAINTREE, 0, 256, lzx_read_lens);\r
+ READ_LENGTHS(MAINTREE, 256, LZX(main_elements), lzx_read_lens);\r
+ BUILD_TABLE(MAINTREE);\r
+ if (LENTABLE(MAINTREE)[0xE8] != 0) LZX(intel_started) = 1;\r
+\r
+ READ_LENGTHS(LENGTH, 0, LZX_NUM_SECONDARY_LENGTHS, lzx_read_lens);\r
+ BUILD_TABLE(LENGTH);\r
+ break;\r
+\r
+ case LZX_BLOCKTYPE_UNCOMPRESSED:\r
+ LZX(intel_started) = 1; /* because we can't assume otherwise */\r
+ ENSURE_BITS(16); /* get up to 16 pad bits into the buffer */\r
+ if (bitsleft > 16) inpos -= 2; /* and align the bitstream! */\r
+ R0 = inpos[0]|(inpos[1]<<8)|(inpos[2]<<16)|(inpos[3]<<24);inpos+=4;\r
+ R1 = inpos[0]|(inpos[1]<<8)|(inpos[2]<<16)|(inpos[3]<<24);inpos+=4;\r
+ R2 = inpos[0]|(inpos[1]<<8)|(inpos[2]<<16)|(inpos[3]<<24);inpos+=4;\r
+ break;\r
+\r
+ default:\r
+ return DECR_ILLEGALDATA;\r
+ }\r
+ }\r
+\r
+ /* buffer exhaustion check */\r
+ if (inpos > endinp) {\r
+ /* it's possible to have a file where the next run is less than\r
+ * 16 bits in size. In this case, the READ_HUFFSYM() macro used\r
+ * in building the tables will exhaust the buffer, so we should\r
+ * allow for this, but not allow those accidentally read bits to\r
+ * be used (so we check that there are at least 16 bits\r
+ * remaining - in this boundary case they aren't really part of\r
+ * the compressed data)\r
+ */\r
+ if (inpos > (endinp+2) || bitsleft < 16) return DECR_ILLEGALDATA;\r
+ }\r
+\r
+ while ((this_run = LZX(block_remaining)) > 0 && togo > 0) {\r
+ if (this_run > togo) this_run = togo;\r
+ togo -= this_run;\r
+ LZX(block_remaining) -= this_run;\r
+\r
+ /* apply 2^x-1 mask */\r
+ window_posn &= window_size - 1;\r
+ /* runs can't straddle the window wraparound */\r
+ if ((window_posn + this_run) > window_size)\r
+ return DECR_DATAFORMAT;\r
+\r
+ switch (LZX(block_type)) {\r
+\r
+ case LZX_BLOCKTYPE_VERBATIM:\r
+ while (this_run > 0) {\r
+ READ_HUFFSYM(MAINTREE, main_element);\r
+\r
+ if (main_element < LZX_NUM_CHARS) {\r
+ /* literal: 0 to LZX_NUM_CHARS-1 */\r
+ window[window_posn++] = main_element;\r
+ this_run--;\r
+ }\r
+ else {\r
+ /* match: LZX_NUM_CHARS + ((slot<<3) | length_header (3 bits)) */\r
+ main_element -= LZX_NUM_CHARS;\r
+ \r
+ match_length = main_element & LZX_NUM_PRIMARY_LENGTHS;\r
+ if (match_length == LZX_NUM_PRIMARY_LENGTHS) {\r
+ READ_HUFFSYM(LENGTH, length_footer);\r
+ match_length += length_footer;\r
+ }\r
+ match_length += LZX_MIN_MATCH;\r
+ \r
+ match_offset = main_element >> 3;\r
+ \r
+ if (match_offset > 2) {\r
+ /* not repeated offset */\r
+ if (match_offset != 3) {\r
+ extra = CAB(extra_bits)[match_offset];\r
+ READ_BITS(verbatim_bits, extra);\r
+ match_offset = CAB(lzx_position_base)[match_offset] \r
+ - 2 + verbatim_bits;\r
+ }\r
+ else {\r
+ match_offset = 1;\r
+ }\r
+ \r
+ /* update repeated offset LRU queue */\r
+ R2 = R1; R1 = R0; R0 = match_offset;\r
+ }\r
+ else if (match_offset == 0) {\r
+ match_offset = R0;\r
+ }\r
+ else if (match_offset == 1) {\r
+ match_offset = R1;\r
+ R1 = R0; R0 = match_offset;\r
+ }\r
+ else /* match_offset == 2 */ {\r
+ match_offset = R2;\r
+ R2 = R0; R0 = match_offset;\r
+ }\r
+\r
+ rundest = window + window_posn;\r
+ this_run -= match_length;\r
+\r
+ /* copy any wrapped around source data */\r
+ if (window_posn >= match_offset) {\r
+ /* no wrap */\r
+ runsrc = rundest - match_offset;\r
+ } else {\r
+ runsrc = rundest + (window_size - match_offset);\r
+ copy_length = match_offset - window_posn;\r
+ if (copy_length < match_length) {\r
+ match_length -= copy_length;\r
+ window_posn += copy_length;\r
+ while (copy_length-- > 0) *rundest++ = *runsrc++;\r
+ runsrc = window;\r
+ }\r
+ }\r
+ window_posn += match_length;\r
+\r
+ /* copy match data - no worries about destination wraps */\r
+ while (match_length-- > 0) *rundest++ = *runsrc++;\r
+ }\r
+ }\r
+ break;\r
+\r
+ case LZX_BLOCKTYPE_ALIGNED:\r
+ while (this_run > 0) {\r
+ READ_HUFFSYM(MAINTREE, main_element);\r
+ \r
+ if (main_element < LZX_NUM_CHARS) {\r
+ /* literal: 0 to LZX_NUM_CHARS-1 */\r
+ window[window_posn++] = main_element;\r
+ this_run--;\r
+ }\r
+ else {\r
+ /* match: LZX_NUM_CHARS + ((slot<<3) | length_header (3 bits)) */\r
+ main_element -= LZX_NUM_CHARS;\r
+ \r
+ match_length = main_element & LZX_NUM_PRIMARY_LENGTHS;\r
+ if (match_length == LZX_NUM_PRIMARY_LENGTHS) {\r
+ READ_HUFFSYM(LENGTH, length_footer);\r
+ match_length += length_footer;\r
+ }\r
+ match_length += LZX_MIN_MATCH;\r
+ \r
+ match_offset = main_element >> 3;\r
+ \r
+ if (match_offset > 2) {\r
+ /* not repeated offset */\r
+ extra = CAB(extra_bits)[match_offset];\r
+ match_offset = CAB(lzx_position_base)[match_offset] - 2;\r
+ if (extra > 3) {\r
+ /* verbatim and aligned bits */\r
+ extra -= 3;\r
+ READ_BITS(verbatim_bits, extra);\r
+ match_offset += (verbatim_bits << 3);\r
+ READ_HUFFSYM(ALIGNED, aligned_bits);\r
+ match_offset += aligned_bits;\r
+ }\r
+ else if (extra == 3) {\r
+ /* aligned bits only */\r
+ READ_HUFFSYM(ALIGNED, aligned_bits);\r
+ match_offset += aligned_bits;\r
+ }\r
+ else if (extra > 0) { /* extra==1, extra==2 */\r
+ /* verbatim bits only */\r
+ READ_BITS(verbatim_bits, extra);\r
+ match_offset += verbatim_bits;\r
+ }\r
+ else /* extra == 0 */ {\r
+ /* ??? */\r
+ match_offset = 1;\r
+ }\r
+ \r
+ /* update repeated offset LRU queue */\r
+ R2 = R1; R1 = R0; R0 = match_offset;\r
+ }\r
+ else if (match_offset == 0) {\r
+ match_offset = R0;\r
+ }\r
+ else if (match_offset == 1) {\r
+ match_offset = R1;\r
+ R1 = R0; R0 = match_offset;\r
+ }\r
+ else /* match_offset == 2 */ {\r
+ match_offset = R2;\r
+ R2 = R0; R0 = match_offset;\r
+ }\r
+\r
+ rundest = window + window_posn;\r
+ this_run -= match_length;\r
+\r
+ /* copy any wrapped around source data */\r
+ if (window_posn >= match_offset) {\r
+ /* no wrap */\r
+ runsrc = rundest - match_offset;\r
+ } else {\r
+ runsrc = rundest + (window_size - match_offset);\r
+ copy_length = match_offset - window_posn;\r
+ if (copy_length < match_length) {\r
+ match_length -= copy_length;\r
+ window_posn += copy_length;\r
+ while (copy_length-- > 0) *rundest++ = *runsrc++;\r
+ runsrc = window;\r
+ }\r
+ }\r
+ window_posn += match_length;\r
+\r
+ /* copy match data - no worries about destination wraps */\r
+ while (match_length-- > 0) *rundest++ = *runsrc++;\r
+ }\r
+ }\r
+ break;\r
+\r
+ case LZX_BLOCKTYPE_UNCOMPRESSED:\r
+ if ((inpos + this_run) > endinp) return DECR_ILLEGALDATA;\r
+ memcpy(window + window_posn, inpos, (size_t) this_run);\r
+ inpos += this_run; window_posn += this_run;\r
+ break;\r
+\r
+ default:\r
+ return DECR_ILLEGALDATA; /* might as well */\r
+ }\r
+\r
+ }\r
+ }\r
+\r
+ if (togo != 0) return DECR_ILLEGALDATA;\r
+ memcpy(CAB(outbuf), window + ((!window_posn) ? window_size : window_posn) -\r
+ outlen, (size_t) outlen);\r
+\r
+ LZX(window_posn) = window_posn;\r
+ LZX(R0) = R0;\r
+ LZX(R1) = R1;\r
+ LZX(R2) = R2;\r
+\r
+ /* intel E8 decoding */\r
+ if ((LZX(frames_read)++ < 32768) && LZX(intel_filesize) != 0) {\r
+ if (outlen <= 6 || !LZX(intel_started)) {\r
+ LZX(intel_curpos) += outlen;\r
+ }\r
+ else {\r
+ cab_UBYTE *data = CAB(outbuf);\r
+ cab_UBYTE *dataend = data + outlen - 10;\r
+ cab_LONG curpos = LZX(intel_curpos);\r
+ cab_LONG filesize = LZX(intel_filesize);\r
+ cab_LONG abs_off, rel_off;\r
+\r
+ LZX(intel_curpos) = curpos + outlen;\r
+\r
+ while (data < dataend) {\r
+ if (*data++ != 0xE8) { curpos++; continue; }\r
+ abs_off = data[0] | (data[1]<<8) | (data[2]<<16) | (data[3]<<24);\r
+ if ((abs_off >= -curpos) && (abs_off < filesize)) {\r
+ rel_off = (abs_off >= 0) ? abs_off - curpos : abs_off + filesize;\r
+ data[0] = (cab_UBYTE) rel_off;\r
+ data[1] = (cab_UBYTE) (rel_off >> 8);\r
+ data[2] = (cab_UBYTE) (rel_off >> 16);\r
+ data[3] = (cab_UBYTE) (rel_off >> 24);\r
+ }\r
+ data += 4;\r
+ curpos += 5;\r
+ }\r
+ }\r
+ }\r
+ return DECR_OK;\r
+}\r
+\r
+/*********************************************************\r
+ * find_cabs_in_file (internal)\r
+ */\r
+struct cabinet *find_cabs_in_file(LPCSTR name, cab_UBYTE search_buf[])\r
+{\r
+ struct cabinet *cab, *cab2, *firstcab = NULL, *linkcab = NULL;\r
+ cab_UBYTE *pstart = &search_buf[0], *pend, *p;\r
+ cab_off_t offset, caboff, cablen = 0, foffset = 0, filelen, length;\r
+ int state = 0, found = 0, ok = 0;\r
+\r
+ TRACE("(name == %s)\n", debugstr_a(name));\r
+\r
+ /* open the file and search for cabinet headers */\r
+ if ((cab = (struct cabinet *) calloc(1, sizeof(struct cabinet)))) {\r
+ cab->filename = name;\r
+ if (cabinet_open(cab)) {\r
+ filelen = cab->filelen;\r
+ for (offset = 0; (offset < filelen); offset += length) {\r
+ /* search length is either the full length of the search buffer,\r
+ * or the amount of data remaining to the end of the file,\r
+ * whichever is less.\r
+ */\r
+ length = filelen - offset;\r
+ if (length > CAB_SEARCH_SIZE) length = CAB_SEARCH_SIZE;\r
+\r
+ /* fill the search buffer with data from disk */\r
+ if (!cabinet_read(cab, search_buf, length)) break;\r
+\r
+ /* read through the entire buffer. */\r
+ p = pstart;\r
+ pend = &search_buf[length];\r
+ while (p < pend) {\r
+ switch (state) {\r
+ /* starting state */\r
+ case 0:\r
+ /* we spend most of our time in this while loop, looking for\r
+ * a leading 'M' of the 'MSCF' signature\r
+ */\r
+ while (*p++ != 0x4D && p < pend);\r
+ if (p < pend) state = 1; /* if we found tht 'M', advance state */\r
+ break;\r
+\r
+ /* verify that the next 3 bytes are 'S', 'C' and 'F' */\r
+ case 1: state = (*p++ == 0x53) ? 2 : 0; break;\r
+ case 2: state = (*p++ == 0x43) ? 3 : 0; break;\r
+ case 3: state = (*p++ == 0x46) ? 4 : 0; break;\r
+\r
+ /* we don't care about bytes 4-7 */\r
+ /* bytes 8-11 are the overall length of the cabinet */\r
+ case 8: cablen = *p++; state++; break;\r
+ case 9: cablen |= *p++ << 8; state++; break;\r
+ case 10: cablen |= *p++ << 16; state++; break;\r
+ case 11: cablen |= *p++ << 24; state++; break;\r
+\r
+ /* we don't care about bytes 12-15 */\r
+ /* bytes 16-19 are the offset within the cabinet of the filedata */\r
+ case 16: foffset = *p++; state++; break;\r
+ case 17: foffset |= *p++ << 8; state++; break;\r
+ case 18: foffset |= *p++ << 16; state++; break;\r
+ case 19: foffset |= *p++ << 24;\r
+ /* now we have received 20 bytes of potential cab header. */\r
+ /* work out the offset in the file of this potential cabinet */\r
+ caboff = offset + (p-pstart) - 20;\r
+\r
+ /* check that the files offset is less than the alleged length\r
+ * of the cabinet, and that the offset + the alleged length are\r
+ * 'roughly' within the end of overall file length\r
+ */\r
+ if ((foffset < cablen) &&\r
+ ((caboff + foffset) < (filelen + 32)) &&\r
+ ((caboff + cablen) < (filelen + 32)) )\r
+ {\r
+ /* found a potential result - try loading it */\r
+ found++;\r
+ cab2 = load_cab_offset(name, caboff);\r
+ if (cab2) {\r
+ /* success */\r
+ ok++;\r
+\r
+ /* cause the search to restart after this cab's data. */\r
+ offset = caboff + cablen;\r
+ if (offset < cab->filelen) cabinet_seek(cab, offset);\r
+ length = 0;\r
+ p = pend;\r
+\r
+ /* link the cab into the list */\r
+ if (linkcab == NULL) firstcab = cab2;\r
+ else linkcab->next = cab2;\r
+ linkcab = cab2;\r
+ }\r
+ }\r
+ state = 0;\r
+ break;\r
+ default:\r
+ p++, state++; break;\r
+ }\r
+ }\r
+ }\r
+ cabinet_close(cab);\r
+ }\r
+ free(cab);\r
+ }\r
+\r
+ /* if there were cabinets that were found but are not ok, point this out */\r
+ if (found > ok) {\r
+ WARN("%s: found %d bad cabinets\n", debugstr_a(name), found-ok);\r
+ }\r
+\r
+ /* if no cabinets were found, let the user know */\r
+ if (!firstcab) {\r
+ WARN("%s: not a Microsoft cabinet file.\n", debugstr_a(name));\r
+ }\r
+ return firstcab;\r
+}\r
+\r
+/***********************************************************************\r
+ * find_cabinet_file (internal)\r
+ *\r
+ * tries to find *cabname, from the directory path of origcab, correcting the\r
+ * case of *cabname if necessary, If found, writes back to *cabname.\r
+ */\r
+void find_cabinet_file(char **cabname, LPCSTR origcab) {\r
+\r
+ char *tail, *cab, *name, *nextpart, nametmp[MAX_PATH], *filepart;\r
+ int found = 0;\r
+\r
+ TRACE("(*cabname == ^%p, origcab == %s)\n", cabname ? *cabname : NULL, debugstr_a(origcab));\r
+\r
+ /* ensure we have a cabinet name at all */\r
+ if (!(name = *cabname)) {\r
+ WARN("no cabinet name at all\n");\r
+ }\r
+\r
+ /* find if there's a directory path in the origcab */\r
+ tail = origcab ? max(strrchr(origcab, '/'), strrchr(origcab, '\\')) : NULL;\r
+\r
+ if ((cab = (char *) malloc(MAX_PATH))) {\r
+ /* add the directory path from the original cabinet name */\r
+ if (tail) {\r
+ memcpy(cab, origcab, tail - origcab);\r
+ cab[tail - origcab] = '\0';\r
+ } else {\r
+ /* default directory path of '.' */\r
+ cab[0] = '.';\r
+ cab[1] = '\0';\r
+ }\r
+\r
+ do {\r
+ TRACE("trying cab == %s\n", debugstr_a(cab));\r
+\r
+ /* we don't want null cabinet filenames */\r
+ if (name[0] == '\0') {\r
+ WARN("null cab name\n");\r
+ break;\r
+ }\r
+\r
+ /* if there is a directory component in the cabinet name,\r
+ * look for that alone first\r
+ */\r
+ nextpart = strchr(name, '\\');\r
+ if (nextpart) *nextpart = '\0';\r
+\r
+ found = SearchPathA(cab, name, NULL, MAX_PATH, nametmp, &filepart);\r
+\r
+ /* if the component was not found, look for it in the current dir */\r
+ if (!found) {\r
+ found = SearchPathA(".", name, NULL, MAX_PATH, nametmp, &filepart);\r
+ }\r
+ \r
+ if (found) \r
+ TRACE("found: %s\n", debugstr_a(nametmp));\r
+ else\r
+ TRACE("not found.\n");\r
+\r
+ /* restore the real name and skip to the next directory component\r
+ * or actual cabinet name\r
+ */\r
+ if (nextpart) *nextpart = '\\', name = &nextpart[1];\r
+\r
+ /* while there is another directory component, and while we\r
+ * successfully found the current component\r
+ */\r
+ } while (nextpart && found);\r
+\r
+ /* if we found the cabinet, change the next cabinet's name.\r
+ * otherwise, pretend nothing happened\r
+ */\r
+ if (found) {\r
+ free((void *) *cabname);\r
+ *cabname = cab;\r
+ strncpy(cab, nametmp, found+1);\r
+ TRACE("result: %s\n", debugstr_a(cab));\r
+ } else {\r
+ free((void *) cab);\r
+ TRACE("result: nothing\n");\r
+ }\r
+ }\r
+}\r
+\r
+/************************************************************************\r
+ * process_files (internal)\r
+ *\r
+ * this does the tricky job of running through every file in the cabinet,\r
+ * including spanning cabinets, and working out which file is in which\r
+ * folder in which cabinet. It also throws out the duplicate file entries\r
+ * that appear in spanning cabinets. There is memory leakage here because\r
+ * those entries are not freed. See the XAD CAB client (function CAB_GetInfo\r
+ * in CAB.c) for an implementation of this that correctly frees the discarded\r
+ * file entries.\r
+ */\r
+struct cab_file *process_files(struct cabinet *basecab) {\r
+ struct cabinet *cab;\r
+ struct cab_file *outfi = NULL, *linkfi = NULL, *nextfi, *fi, *cfi;\r
+ struct cab_folder *fol, *firstfol, *lastfol = NULL, *predfol;\r
+ int i, mergeok;\r
+\r
+ FIXME("(basecab == ^%p): Memory leak.\n", basecab);\r
+\r
+ for (cab = basecab; cab; cab = cab->nextcab) {\r
+ /* firstfol = first folder in this cabinet */\r
+ /* lastfol = last folder in this cabinet */\r
+ /* predfol = last folder in previous cabinet (or NULL if first cabinet) */\r
+ predfol = lastfol;\r
+ firstfol = cab->folders;\r
+ for (lastfol = firstfol; lastfol->next;) lastfol = lastfol->next;\r
+ mergeok = 1;\r
+\r
+ for (fi = cab->files; fi; fi = nextfi) {\r
+ i = fi->index;\r
+ nextfi = fi->next;\r
+\r
+ if (i < cffileCONTINUED_FROM_PREV) {\r
+ for (fol = firstfol; fol && i--; ) fol = fol->next;\r
+ fi->folder = fol; /* NULL if an invalid folder index */\r
+ }\r
+ else {\r
+ /* folder merging */\r
+ if (i == cffileCONTINUED_TO_NEXT\r
+ || i == cffileCONTINUED_PREV_AND_NEXT) {\r
+ if (cab->nextcab && !lastfol->contfile) lastfol->contfile = fi;\r
+ }\r
+\r
+ if (i == cffileCONTINUED_FROM_PREV\r
+ || i == cffileCONTINUED_PREV_AND_NEXT) {\r
+ /* these files are to be continued in yet another\r
+ * cabinet, don't merge them in just yet */\r
+ if (i == cffileCONTINUED_PREV_AND_NEXT) mergeok = 0;\r
+\r
+ /* only merge once per cabinet */\r
+ if (predfol) {\r
+ if ((cfi = predfol->contfile)\r
+ && (cfi->offset == fi->offset)\r
+ && (cfi->length == fi->length)\r
+ && (strcmp(cfi->filename, fi->filename) == 0)\r
+ && (predfol->comp_type == firstfol->comp_type)) {\r
+ /* increase the number of splits */\r
+ if ((i = ++(predfol->num_splits)) > CAB_SPLITMAX) {\r
+ mergeok = 0;\r
+ ERR("%s: internal error: CAB_SPLITMAX exceeded. please report this to wine-devel@winehq.org)\n",\r
+ debugstr_a(basecab->filename));\r
+ }\r
+ else {\r
+ /* copy information across from the merged folder */\r
+ predfol->offset[i] = firstfol->offset[0];\r
+ predfol->cab[i] = firstfol->cab[0];\r
+ predfol->next = firstfol->next;\r
+ predfol->contfile = firstfol->contfile;\r
+\r
+ if (firstfol == lastfol) lastfol = predfol;\r
+ firstfol = predfol;\r
+ predfol = NULL; /* don't merge again within this cabinet */\r
+ }\r
+ }\r
+ else {\r
+ /* if the folders won't merge, don't add their files */\r
+ mergeok = 0;\r
+ }\r
+ }\r
+\r
+ if (mergeok) fi->folder = firstfol;\r
+ }\r
+ }\r
+\r
+ if (fi->folder) {\r
+ if (linkfi) linkfi->next = fi; else outfi = fi;\r
+ linkfi = fi;\r
+ }\r
+ } /* for (fi= .. */\r
+ } /* for (cab= ...*/\r
+\r
+ return outfi;\r
+}\r
+\r
+/****************************************************************\r
+ * convertUTF (internal)\r
+ *\r
+ * translate UTF -> ASCII\r
+ *\r
+ * UTF translates two-byte unicode characters into 1, 2 or 3 bytes.\r
+ * %000000000xxxxxxx -> %0xxxxxxx\r
+ * %00000xxxxxyyyyyy -> %110xxxxx %10yyyyyy\r
+ * %xxxxyyyyyyzzzzzz -> %1110xxxx %10yyyyyy %10zzzzzz\r
+ *\r
+ * Therefore, the inverse is as follows:\r
+ * First char:\r
+ * 0x00 - 0x7F = one byte char\r
+ * 0x80 - 0xBF = invalid\r
+ * 0xC0 - 0xDF = 2 byte char (next char only 0x80-0xBF is valid)\r
+ * 0xE0 - 0xEF = 3 byte char (next 2 chars only 0x80-0xBF is valid)\r
+ * 0xF0 - 0xFF = invalid\r
+ * \r
+ * FIXME: use a winapi to do this\r
+ */\r
+int convertUTF(cab_UBYTE *in) {\r
+ cab_UBYTE c, *out = in, *end = in + strlen((char *) in) + 1;\r
+ cab_ULONG x;\r
+\r
+ do {\r
+ /* read unicode character */\r
+ if ((c = *in++) < 0x80) x = c;\r
+ else {\r
+ if (c < 0xC0) return 0;\r
+ else if (c < 0xE0) {\r
+ x = (c & 0x1F) << 6;\r
+ if ((c = *in++) < 0x80 || c > 0xBF) return 0; else x |= (c & 0x3F);\r
+ }\r
+ else if (c < 0xF0) {\r
+ x = (c & 0xF) << 12;\r
+ if ((c = *in++) < 0x80 || c > 0xBF) return 0; else x |= (c & 0x3F)<<6;\r
+ if ((c = *in++) < 0x80 || c > 0xBF) return 0; else x |= (c & 0x3F);\r
+ }\r
+ else return 0;\r
+ }\r
+\r
+ /* terrible unicode -> ASCII conversion */\r
+ if (x > 127) x = '_';\r
+\r
+ if (in > end) return 0; /* just in case */\r
+ } while ((*out++ = (cab_UBYTE) x));\r
+ return 1;\r
+}\r
+\r
+/****************************************************\r
+ * NONEdecompress (internal)\r
+ */\r
+int NONEdecompress(int inlen, int outlen, cab_decomp_state *decomp_state)\r
+{\r
+ if (inlen != outlen) return DECR_ILLEGALDATA;\r
+ memcpy(CAB(outbuf), CAB(inbuf), (size_t) inlen);\r
+ return DECR_OK;\r
+}\r
+\r
+/**************************************************\r
+ * checksum (internal)\r
+ */\r
+cab_ULONG checksum(cab_UBYTE *data, cab_UWORD bytes, cab_ULONG csum) {\r
+ int len;\r
+ cab_ULONG ul = 0;\r
+\r
+ for (len = bytes >> 2; len--; data += 4) {\r
+ csum ^= ((data[0]) | (data[1]<<8) | (data[2]<<16) | (data[3]<<24));\r
+ }\r
+\r
+ switch (bytes & 3) {\r
+ case 3: ul |= *data++ << 16;\r
+ case 2: ul |= *data++ << 8;\r
+ case 1: ul |= *data;\r
+ }\r
+ csum ^= ul;\r
+\r
+ return csum;\r
+}\r
+\r
+/**********************************************************\r
+ * decompress (internal)\r
+ */\r
+int decompress(struct cab_file *fi, int savemode, int fix, cab_decomp_state *decomp_state)\r
+{\r
+ cab_ULONG bytes = savemode ? fi->length : fi->offset - CAB(offset);\r
+ struct cabinet *cab = CAB(current)->cab[CAB(split)];\r
+ cab_UBYTE buf[cfdata_SIZEOF], *data;\r
+ cab_UWORD inlen, len, outlen, cando;\r
+ cab_ULONG cksum;\r
+ cab_LONG err;\r
+\r
+ TRACE("(fi == ^%p, savemode == %d, fix == %d)\n", fi, savemode, fix);\r
+\r
+ while (bytes > 0) {\r
+ /* cando = the max number of bytes we can do */\r
+ cando = CAB(outlen);\r
+ if (cando > bytes) cando = bytes;\r
+\r
+ /* if cando != 0 */\r
+ if (cando && savemode)\r
+ file_write(fi, CAB(outpos), cando);\r
+\r
+ CAB(outpos) += cando;\r
+ CAB(outlen) -= cando;\r
+ bytes -= cando; if (!bytes) break;\r
+\r
+ /* we only get here if we emptied the output buffer */\r
+\r
+ /* read data header + data */\r
+ inlen = outlen = 0;\r
+ while (outlen == 0) {\r
+ /* read the block header, skip the reserved part */\r
+ if (!cabinet_read(cab, buf, cfdata_SIZEOF)) return DECR_INPUT;\r
+ cabinet_skip(cab, cab->block_resv);\r
+\r
+ /* we shouldn't get blocks over CAB_INPUTMAX in size */\r
+ data = CAB(inbuf) + inlen;\r
+ len = EndGetI16(buf+cfdata_CompressedSize);\r
+ inlen += len;\r
+ if (inlen > CAB_INPUTMAX) return DECR_INPUT;\r
+ if (!cabinet_read(cab, data, len)) return DECR_INPUT;\r
+\r
+ /* clear two bytes after read-in data */\r
+ data[len+1] = data[len+2] = 0;\r
+\r
+ /* perform checksum test on the block (if one is stored) */\r
+ cksum = EndGetI32(buf+cfdata_CheckSum);\r
+ if (cksum && cksum != checksum(buf+4, 4, checksum(data, len, 0))) {\r
+ /* checksum is wrong */\r
+ if (fix && ((fi->folder->comp_type & cffoldCOMPTYPE_MASK)\r
+ == cffoldCOMPTYPE_MSZIP))\r
+ {\r
+ WARN("%s: checksum failed\n", debugstr_a(fi->filename)); \r
+ }\r
+ else {\r
+ return DECR_CHECKSUM;\r
+ }\r
+ }\r
+\r
+ /* outlen=0 means this block was part of a split block */\r
+ outlen = EndGetI16(buf+cfdata_UncompressedSize);\r
+ if (outlen == 0) {\r
+ cabinet_close(cab);\r
+ cab = CAB(current)->cab[++CAB(split)];\r
+ if (!cabinet_open(cab)) return DECR_INPUT;\r
+ cabinet_seek(cab, CAB(current)->offset[CAB(split)]);\r
+ }\r
+ }\r
+\r
+ /* decompress block */\r
+ if ((err = CAB(decompress)(inlen, outlen, decomp_state))) {\r
+ if (fix && ((fi->folder->comp_type & cffoldCOMPTYPE_MASK)\r
+ == cffoldCOMPTYPE_MSZIP))\r
+ {\r
+ ERR("%s: failed decrunching block\n", debugstr_a(fi->filename)); \r
+ }\r
+ else {\r
+ return err;\r
+ }\r
+ }\r
+ CAB(outlen) = outlen;\r
+ CAB(outpos) = CAB(outbuf);\r
+ }\r
+\r
+ return DECR_OK;\r
+}\r
+\r
+/****************************************************************\r
+ * extract_file (internal)\r
+ *\r
+ * workhorse to extract a particular file from a cab\r
+ */\r
+void extract_file(struct cab_file *fi, int lower, int fix, LPCSTR dir, cab_decomp_state *decomp_state)\r
+{\r
+ struct cab_folder *fol = fi->folder, *oldfol = CAB(current);\r
+ cab_LONG err = DECR_OK;\r
+\r
+ TRACE("(fi == ^%p, lower == %d, fix == %d, dir == %s)\n", fi, lower, fix, debugstr_a(dir));\r
+\r
+ /* is a change of folder needed? do we need to reset the current folder? */\r
+ if (fol != oldfol || fi->offset < CAB(offset)) {\r
+ cab_UWORD comptype = fol->comp_type;\r
+ int ct1 = comptype & cffoldCOMPTYPE_MASK;\r
+ int ct2 = oldfol ? (oldfol->comp_type & cffoldCOMPTYPE_MASK) : 0;\r
+\r
+ /* if the archiver has changed, call the old archiver's free() function */\r
+ if (ct1 != ct2) {\r
+ switch (ct2) {\r
+ case cffoldCOMPTYPE_LZX:\r
+ if (LZX(window)) {\r
+ free(LZX(window));\r
+ LZX(window) = NULL;\r
+ }\r
+ break;\r
+ case cffoldCOMPTYPE_QUANTUM:\r
+ if (QTM(window)) {\r
+ free(QTM(window));\r
+ QTM(window) = NULL;\r
+ }\r
+ break;\r
+ }\r
+ }\r
+\r
+ switch (ct1) {\r
+ case cffoldCOMPTYPE_NONE:\r
+ CAB(decompress) = NONEdecompress;\r
+ break;\r
+\r
+ case cffoldCOMPTYPE_MSZIP:\r
+ CAB(decompress) = ZIPdecompress;\r
+ break;\r
+\r
+ case cffoldCOMPTYPE_QUANTUM:\r
+ CAB(decompress) = QTMdecompress;\r
+ err = QTMinit((comptype >> 8) & 0x1f, (comptype >> 4) & 0xF, decomp_state);\r
+ break;\r
+\r
+ case cffoldCOMPTYPE_LZX:\r
+ CAB(decompress) = LZXdecompress;\r
+ err = LZXinit((comptype >> 8) & 0x1f, decomp_state);\r
+ break;\r
+\r
+ default:\r
+ err = DECR_DATAFORMAT;\r
+ }\r
+ if (err) goto exit_handler;\r
+\r
+ /* initialisation OK, set current folder and reset offset */\r
+ if (oldfol) cabinet_close(oldfol->cab[CAB(split)]);\r
+ if (!cabinet_open(fol->cab[0])) goto exit_handler;\r
+ cabinet_seek(fol->cab[0], fol->offset[0]);\r
+ CAB(current) = fol;\r
+ CAB(offset) = 0;\r
+ CAB(outlen) = 0; /* discard existing block */\r
+ CAB(split) = 0;\r
+ }\r
+\r
+ if (fi->offset > CAB(offset)) {\r
+ /* decode bytes and send them to /dev/null */\r
+ if ((err = decompress(fi, 0, fix, decomp_state))) goto exit_handler;\r
+ CAB(offset) = fi->offset;\r
+ }\r
+ \r
+ if (!file_open(fi, lower, dir)) return;\r
+ err = decompress(fi, 1, fix, decomp_state);\r
+ if (err) CAB(current) = NULL; else CAB(offset) += fi->length;\r
+ file_close(fi);\r
+\r
+exit_handler:\r
+ if (err) {\r
+ const char *errmsg;\r
+ const char *cabname;\r
+ switch (err) {\r
+ case DECR_NOMEMORY:\r
+ errmsg = "out of memory!\n"; break;\r
+ case DECR_ILLEGALDATA:\r
+ errmsg = "%s: illegal or corrupt data\n"; break;\r
+ case DECR_DATAFORMAT:\r
+ errmsg = "%s: unsupported data format\n"; break;\r
+ case DECR_CHECKSUM:\r
+ errmsg = "%s: checksum error\n"; break;\r
+ case DECR_INPUT:\r
+ errmsg = "%s: input error\n"; break;\r
+ case DECR_OUTPUT:\r
+ errmsg = "%s: output error\n"; break;\r
+ default:\r
+ errmsg = "%s: unknown error (BUG)\n";\r
+ }\r
+\r
+ if (CAB(current)) {\r
+ cabname = (CAB(current)->cab[CAB(split)]->filename);\r
+ }\r
+ else {\r
+ cabname = (fi->folder->cab[0]->filename);\r
+ }\r
+\r
+ ERR((char *)errmsg, cabname);\r
+ }\r
+}\r
+\r
+/*********************************************************\r
+ * print_fileinfo (internal)\r
+ */\r
+void print_fileinfo(struct cab_file *fi) {\r
+ int d = fi->date, t = fi->time;\r
+ char *fname = NULL;\r
+\r
+ if (fi->attribs & cffile_A_NAME_IS_UTF) {\r
+ fname = malloc(strlen(fi->filename) + 1);\r
+ if (fname) {\r
+ strcpy(fname, fi->filename);\r
+ convertUTF((cab_UBYTE *) fname);\r
+ }\r
+ }\r
+\r
+ TRACE("%9u | %02d.%02d.%04d %02d:%02d:%02d | %s\n",\r
+ fi->length, \r
+ d & 0x1f, (d>>5) & 0xf, (d>>9) + 1980,\r
+ t >> 11, (t>>5) & 0x3f, (t << 1) & 0x3e,\r
+ fname ? fname : fi->filename\r
+ );\r
+\r
+ if (fname) free(fname);\r
+}\r
+\r
+/****************************************************************************\r
+ * process_cabinet (internal) \r
+ *\r
+ * called to simply "extract" a cabinet file. Will find every cabinet file\r
+ * in that file, search for every chained cabinet attached to those cabinets,\r
+ * and will either extract the cabinets, or ? (call a callback?)\r
+ *\r
+ * PARAMS\r
+ * cabname [I] name of the cabinet file to extract\r
+ * dir [I] directory to extract to\r
+ * fix [I] attempt to process broken cabinets\r
+ * lower [I] ? (lower case something or other?)\r
+ * dest [O] \r
+ *\r
+ * RETURNS\r
+ * Success: TRUE\r
+ * Failure: FALSE\r
+ */\r
+BOOL process_cabinet(LPCSTR cabname, LPCSTR dir, BOOL fix, BOOL lower, EXTRACTdest *dest)\r
+{\r
+ struct cabinet *basecab, *cab, *cab1, *cab2;\r
+ struct cab_file *filelist, *fi;\r
+ struct ExtractFileList **destlistptr = &(dest->filelist);\r
+\r
+ /* The first result of a search will be returned, and\r
+ * the remaining results will be chained to it via the cab->next structure\r
+ * member.\r
+ */\r
+ cab_UBYTE search_buf[CAB_SEARCH_SIZE];\r
+\r
+ cab_decomp_state decomp_state_local;\r
+ cab_decomp_state *decomp_state = &decomp_state_local;\r
+\r
+ /* has the list-mode header been seen before? */\r
+ int viewhdr = 0;\r
+\r
+ ZeroMemory(decomp_state, sizeof(cab_decomp_state));\r
+\r
+ TRACE("Extract %s\n", debugstr_a(cabname));\r
+\r
+ /* load the file requested */\r
+ basecab = find_cabs_in_file(cabname, search_buf);\r
+ if (!basecab) return FALSE;\r
+\r
+ /* iterate over all cabinets found in that file */\r
+ for (cab = basecab; cab; cab=cab->next) {\r
+\r
+ /* bi-directionally load any spanning cabinets -- backwards */\r
+ for (cab1 = cab; cab1->flags & cfheadPREV_CABINET; cab1 = cab1->prevcab) {\r
+ TRACE("%s: extends backwards to %s (%s)\n", debugstr_a(cabname),\r
+ debugstr_a(cab1->prevname), debugstr_a(cab1->previnfo));\r
+ find_cabinet_file(&(cab1->prevname), cabname);\r
+ if (!(cab1->prevcab = load_cab_offset(cab1->prevname, 0))) {\r
+ ERR("%s: can't read previous cabinet %s\n", debugstr_a(cabname), debugstr_a(cab1->prevname));\r
+ break;\r
+ }\r
+ cab1->prevcab->nextcab = cab1;\r
+ }\r
+\r
+ /* bi-directionally load any spanning cabinets -- forwards */\r
+ for (cab2 = cab; cab2->flags & cfheadNEXT_CABINET; cab2 = cab2->nextcab) {\r
+ TRACE("%s: extends to %s (%s)\n", debugstr_a(cabname),\r
+ debugstr_a(cab2->nextname), debugstr_a(cab2->nextinfo));\r
+ find_cabinet_file(&(cab2->nextname), cabname);\r
+ if (!(cab2->nextcab = load_cab_offset(cab2->nextname, 0))) {\r
+ ERR("%s: can't read next cabinet %s\n", debugstr_a(cabname), debugstr_a(cab2->nextname));\r
+ break;\r
+ }\r
+ cab2->nextcab->prevcab = cab2;\r
+ }\r
+\r
+ filelist = process_files(cab1);\r
+ CAB(current) = NULL;\r
+\r
+ if (!viewhdr) {\r
+ TRACE("File size | Date Time | Name\n");\r
+ TRACE("----------+---------------------+-------------\n");\r
+ viewhdr = 1;\r
+ }\r
+ for (fi = filelist; fi; fi = fi->next) {\r
+ print_fileinfo(fi);\r
+ dest->filecount++;\r
+ }\r
+ TRACE("Beginning Extraction...\n");\r
+ for (fi = filelist; fi; fi = fi->next) {\r
+ TRACE(" extracting: %s\n", debugstr_a(fi->filename));\r
+ extract_file(fi, lower, fix, dir, decomp_state);\r
+ sprintf(dest->lastfile, "%s%s%s",\r
+ strlen(dest->directory) ? dest->directory : "",\r
+ strlen(dest->directory) ? "\\": "",\r
+ fi->filename);\r
+ *destlistptr = HeapAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY,\r
+ sizeof(struct ExtractFileList));\r
+ if(*destlistptr) {\r
+ (*destlistptr)->unknown = TRUE; /* FIXME: were do we get the value? */\r
+ (*destlistptr)->filename = HeapAlloc(GetProcessHeap(), 0, (\r
+ strlen(fi->filename)+1));\r
+ if((*destlistptr)->filename) \r
+ lstrcpyA((*destlistptr)->filename, fi->filename);\r
+ destlistptr = &((*destlistptr)->next);\r
+ }\r
+ }\r
+ }\r
+\r
+ TRACE("Finished processing cabinet.\n");\r
+\r
+ return TRUE;\r
+}\r
--- /dev/null
+/*\r
+ * cabinet.h\r
+ *\r
+ * Copyright 2002 Greg Turner\r
+ *\r
+ * This library is free software; you can redistribute it and/or\r
+ * modify it under the terms of the GNU Lesser General Public\r
+ * License as published by the Free Software Foundation; either\r
+ * version 2.1 of the License, or (at your option) any later version.\r
+ *\r
+ * This library is distributed in the hope that it will be useful,\r
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of\r
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r
+ * Lesser General Public License for more details.\r
+ *\r
+ * You should have received a copy of the GNU Lesser General Public\r
+ * License along with this library; if not, write to the Free Software\r
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\r
+ */\r
+#ifndef __WINE_CABINET_H\r
+#define __WINE_CABINET_H\r
+\r
+#include <stdarg.h>\r
+\r
+#include "windef.h"\r
+#include "winbase.h"\r
+#include "winnt.h"\r
+#include "fdi.h"\r
+#include "fci.h"\r
+\r
+/* from msvcrt/sys/stat.h */\r
+#define _S_IWRITE 0x0080\r
+#define _S_IREAD 0x0100\r
+\r
+#define CAB_SPLITMAX (10)\r
+\r
+#define CAB_SEARCH_SIZE (32*1024)\r
+\r
+typedef unsigned char cab_UBYTE; /* 8 bits */\r
+typedef UINT16 cab_UWORD; /* 16 bits */\r
+typedef UINT32 cab_ULONG; /* 32 bits */\r
+typedef INT32 cab_LONG; /* 32 bits */\r
+\r
+typedef UINT32 cab_off_t;\r
+\r
+/* number of bits in a ULONG */\r
+#ifndef CHAR_BIT\r
+# define CHAR_BIT (8)\r
+#endif\r
+#define CAB_ULONG_BITS (sizeof(cab_ULONG) * CHAR_BIT)\r
+\r
+/* structure offsets */\r
+#define cfhead_Signature (0x00)\r
+#define cfhead_CabinetSize (0x08)\r
+#define cfhead_FileOffset (0x10)\r
+#define cfhead_MinorVersion (0x18)\r
+#define cfhead_MajorVersion (0x19)\r
+#define cfhead_NumFolders (0x1A)\r
+#define cfhead_NumFiles (0x1C)\r
+#define cfhead_Flags (0x1E)\r
+#define cfhead_SetID (0x20)\r
+#define cfhead_CabinetIndex (0x22)\r
+#define cfhead_SIZEOF (0x24)\r
+#define cfheadext_HeaderReserved (0x00)\r
+#define cfheadext_FolderReserved (0x02)\r
+#define cfheadext_DataReserved (0x03)\r
+#define cfheadext_SIZEOF (0x04)\r
+#define cffold_DataOffset (0x00)\r
+#define cffold_NumBlocks (0x04)\r
+#define cffold_CompType (0x06)\r
+#define cffold_SIZEOF (0x08)\r
+#define cffile_UncompressedSize (0x00)\r
+#define cffile_FolderOffset (0x04)\r
+#define cffile_FolderIndex (0x08)\r
+#define cffile_Date (0x0A)\r
+#define cffile_Time (0x0C)\r
+#define cffile_Attribs (0x0E)\r
+#define cffile_SIZEOF (0x10)\r
+#define cfdata_CheckSum (0x00)\r
+#define cfdata_CompressedSize (0x04)\r
+#define cfdata_UncompressedSize (0x06)\r
+#define cfdata_SIZEOF (0x08)\r
+\r
+/* flags */\r
+#define cffoldCOMPTYPE_MASK (0x000f)\r
+#define cffoldCOMPTYPE_NONE (0x0000)\r
+#define cffoldCOMPTYPE_MSZIP (0x0001)\r
+#define cffoldCOMPTYPE_QUANTUM (0x0002)\r
+#define cffoldCOMPTYPE_LZX (0x0003)\r
+#define cfheadPREV_CABINET (0x0001)\r
+#define cfheadNEXT_CABINET (0x0002)\r
+#define cfheadRESERVE_PRESENT (0x0004)\r
+#define cffileCONTINUED_FROM_PREV (0xFFFD)\r
+#define cffileCONTINUED_TO_NEXT (0xFFFE)\r
+#define cffileCONTINUED_PREV_AND_NEXT (0xFFFF)\r
+#define cffile_A_RDONLY (0x01)\r
+#define cffile_A_HIDDEN (0x02)\r
+#define cffile_A_SYSTEM (0x04)\r
+#define cffile_A_ARCH (0x20)\r
+#define cffile_A_EXEC (0x40)\r
+#define cffile_A_NAME_IS_UTF (0x80)\r
+\r
+/****************************************************************************/\r
+/* our archiver information / state */\r
+\r
+/* MSZIP stuff */\r
+#define ZIPWSIZE 0x8000 /* window size */\r
+#define ZIPLBITS 9 /* bits in base literal/length lookup table */\r
+#define ZIPDBITS 6 /* bits in base distance lookup table */\r
+#define ZIPBMAX 16 /* maximum bit length of any code */\r
+#define ZIPN_MAX 288 /* maximum number of codes in any set */\r
+\r
+struct Ziphuft {\r
+ cab_UBYTE e; /* number of extra bits or operation */\r
+ cab_UBYTE b; /* number of bits in this code or subcode */\r
+ union {\r
+ cab_UWORD n; /* literal, length base, or distance base */\r
+ struct Ziphuft *t; /* pointer to next level of table */\r
+ } v;\r
+};\r
+\r
+struct ZIPstate {\r
+ cab_ULONG window_posn; /* current offset within the window */\r
+ cab_ULONG bb; /* bit buffer */\r
+ cab_ULONG bk; /* bits in bit buffer */\r
+ cab_ULONG ll[288+32]; /* literal/length and distance code lengths */\r
+ cab_ULONG c[ZIPBMAX+1]; /* bit length count table */\r
+ cab_LONG lx[ZIPBMAX+1]; /* memory for l[-1..ZIPBMAX-1] */\r
+ struct Ziphuft *u[ZIPBMAX]; /* table stack */\r
+ cab_ULONG v[ZIPN_MAX]; /* values in order of bit length */\r
+ cab_ULONG x[ZIPBMAX+1]; /* bit offsets, then code stack */\r
+ cab_UBYTE *inpos;\r
+};\r
+ \r
+/* Quantum stuff */\r
+\r
+struct QTMmodelsym {\r
+ cab_UWORD sym, cumfreq;\r
+};\r
+\r
+struct QTMmodel {\r
+ int shiftsleft, entries; \r
+ struct QTMmodelsym *syms;\r
+ cab_UWORD tabloc[256];\r
+};\r
+\r
+struct QTMstate {\r
+ cab_UBYTE *window; /* the actual decoding window */\r
+ cab_ULONG window_size; /* window size (1Kb through 2Mb) */\r
+ cab_ULONG actual_size; /* window size when it was first allocated */\r
+ cab_ULONG window_posn; /* current offset within the window */\r
+\r
+ struct QTMmodel model7;\r
+ struct QTMmodelsym m7sym[7+1];\r
+\r
+ struct QTMmodel model4, model5, model6pos, model6len;\r
+ struct QTMmodelsym m4sym[0x18 + 1];\r
+ struct QTMmodelsym m5sym[0x24 + 1];\r
+ struct QTMmodelsym m6psym[0x2a + 1], m6lsym[0x1b + 1];\r
+\r
+ struct QTMmodel model00, model40, model80, modelC0;\r
+ struct QTMmodelsym m00sym[0x40 + 1], m40sym[0x40 + 1];\r
+ struct QTMmodelsym m80sym[0x40 + 1], mC0sym[0x40 + 1];\r
+};\r
+\r
+/* LZX stuff */\r
+\r
+/* some constants defined by the LZX specification */\r
+#define LZX_MIN_MATCH (2)\r
+#define LZX_MAX_MATCH (257)\r
+#define LZX_NUM_CHARS (256)\r
+#define LZX_BLOCKTYPE_INVALID (0) /* also blocktypes 4-7 invalid */\r
+#define LZX_BLOCKTYPE_VERBATIM (1)\r
+#define LZX_BLOCKTYPE_ALIGNED (2)\r
+#define LZX_BLOCKTYPE_UNCOMPRESSED (3)\r
+#define LZX_PRETREE_NUM_ELEMENTS (20)\r
+#define LZX_ALIGNED_NUM_ELEMENTS (8) /* aligned offset tree #elements */\r
+#define LZX_NUM_PRIMARY_LENGTHS (7) /* this one missing from spec! */\r
+#define LZX_NUM_SECONDARY_LENGTHS (249) /* length tree #elements */\r
+\r
+/* LZX huffman defines: tweak tablebits as desired */\r
+#define LZX_PRETREE_MAXSYMBOLS (LZX_PRETREE_NUM_ELEMENTS)\r
+#define LZX_PRETREE_TABLEBITS (6)\r
+#define LZX_MAINTREE_MAXSYMBOLS (LZX_NUM_CHARS + 50*8)\r
+#define LZX_MAINTREE_TABLEBITS (12)\r
+#define LZX_LENGTH_MAXSYMBOLS (LZX_NUM_SECONDARY_LENGTHS+1)\r
+#define LZX_LENGTH_TABLEBITS (12)\r
+#define LZX_ALIGNED_MAXSYMBOLS (LZX_ALIGNED_NUM_ELEMENTS)\r
+#define LZX_ALIGNED_TABLEBITS (7)\r
+\r
+#define LZX_LENTABLE_SAFETY (64) /* we allow length table decoding overruns */\r
+\r
+#define LZX_DECLARE_TABLE(tbl) \\r
+ cab_UWORD tbl##_table[(1<<LZX_##tbl##_TABLEBITS) + (LZX_##tbl##_MAXSYMBOLS<<1)];\\r
+ cab_UBYTE tbl##_len [LZX_##tbl##_MAXSYMBOLS + LZX_LENTABLE_SAFETY]\r
+\r
+struct LZXstate {\r
+ cab_UBYTE *window; /* the actual decoding window */\r
+ cab_ULONG window_size; /* window size (32Kb through 2Mb) */\r
+ cab_ULONG actual_size; /* window size when it was first allocated */\r
+ cab_ULONG window_posn; /* current offset within the window */\r
+ cab_ULONG R0, R1, R2; /* for the LRU offset system */\r
+ cab_UWORD main_elements; /* number of main tree elements */\r
+ int header_read; /* have we started decoding at all yet? */\r
+ cab_UWORD block_type; /* type of this block */\r
+ cab_ULONG block_length; /* uncompressed length of this block */\r
+ cab_ULONG block_remaining; /* uncompressed bytes still left to decode */\r
+ cab_ULONG frames_read; /* the number of CFDATA blocks processed */\r
+ cab_LONG intel_filesize; /* magic header value used for transform */\r
+ cab_LONG intel_curpos; /* current offset in transform space */\r
+ int intel_started; /* have we seen any translatable data yet? */\r
+\r
+ LZX_DECLARE_TABLE(PRETREE);\r
+ LZX_DECLARE_TABLE(MAINTREE);\r
+ LZX_DECLARE_TABLE(LENGTH);\r
+ LZX_DECLARE_TABLE(ALIGNED);\r
+};\r
+\r
+struct lzx_bits {\r
+ cab_ULONG bb;\r
+ int bl;\r
+ cab_UBYTE *ip;\r
+};\r
+\r
+/* CAB data blocks are <= 32768 bytes in uncompressed form. Uncompressed\r
+ * blocks have zero growth. MSZIP guarantees that it won't grow above\r
+ * uncompressed size by more than 12 bytes. LZX guarantees it won't grow\r
+ * more than 6144 bytes.\r
+ */\r
+#define CAB_BLOCKMAX (32768)\r
+#define CAB_INPUTMAX (CAB_BLOCKMAX+6144)\r
+\r
+struct cab_file {\r
+ struct cab_file *next; /* next file in sequence */\r
+ struct cab_folder *folder; /* folder that contains this file */\r
+ LPCSTR filename; /* output name of file */\r
+ HANDLE fh; /* open file handle or NULL */\r
+ cab_ULONG length; /* uncompressed length of file */\r
+ cab_ULONG offset; /* uncompressed offset in folder */\r
+ cab_UWORD index; /* magic index number of folder */\r
+ cab_UWORD time, date, attribs; /* MS-DOS time/date/attributes */\r
+};\r
+\r
+\r
+struct cab_folder {\r
+ struct cab_folder *next;\r
+ struct cabinet *cab[CAB_SPLITMAX]; /* cabinet(s) this folder spans */\r
+ cab_off_t offset[CAB_SPLITMAX]; /* offset to data blocks */\r
+ cab_UWORD comp_type; /* compression format/window size */\r
+ cab_ULONG comp_size; /* compressed size of folder */\r
+ cab_UBYTE num_splits; /* number of split blocks + 1 */\r
+ cab_UWORD num_blocks; /* total number of blocks */\r
+ struct cab_file *contfile; /* the first split file */\r
+};\r
+\r
+struct cabinet {\r
+ struct cabinet *next; /* for making a list of cabinets */\r
+ LPCSTR filename; /* input name of cabinet */\r
+ HANDLE *fh; /* open file handle or NULL */\r
+ cab_off_t filelen; /* length of cabinet file */\r
+ cab_off_t blocks_off; /* offset to data blocks in file */\r
+ struct cabinet *prevcab, *nextcab; /* multipart cabinet chains */\r
+ char *prevname, *nextname; /* and their filenames */\r
+ char *previnfo, *nextinfo; /* and their visible names */\r
+ struct cab_folder *folders; /* first folder in this cabinet */\r
+ struct cab_file *files; /* first file in this cabinet */\r
+ cab_UBYTE block_resv; /* reserved space in datablocks */\r
+ cab_UBYTE flags; /* header flags */\r
+};\r
+\r
+typedef struct cds_forward {\r
+ struct cab_folder *current; /* current folder we're extracting from */\r
+ cab_ULONG offset; /* uncompressed offset within folder */\r
+ cab_UBYTE *outpos; /* (high level) start of data to use up */\r
+ cab_UWORD outlen; /* (high level) amount of data to use up */\r
+ cab_UWORD split; /* at which split in current folder? */\r
+ int (*decompress)(int, int, struct cds_forward *); /* chosen compress fn */\r
+ cab_UBYTE inbuf[CAB_INPUTMAX+2]; /* +2 for lzx bitbuffer overflows! */\r
+ cab_UBYTE outbuf[CAB_BLOCKMAX];\r
+ cab_UBYTE q_length_base[27], q_length_extra[27], q_extra_bits[42];\r
+ cab_ULONG q_position_base[42];\r
+ cab_ULONG lzx_position_base[51];\r
+ cab_UBYTE extra_bits[51];\r
+ union {\r
+ struct ZIPstate zip;\r
+ struct QTMstate qtm;\r
+ struct LZXstate lzx;\r
+ } methods;\r
+} cab_decomp_state;\r
+\r
+/* _Int as in "Internal" fyi */\r
+\r
+typedef struct {\r
+ unsigned int FCI_Intmagic;\r
+} FCI_Int, *PFCI_Int;\r
+\r
+typedef struct {\r
+ unsigned int FDI_Intmagic;\r
+ PFNALLOC pfnalloc;\r
+ PFNFREE pfnfree;\r
+ PFNOPEN pfnopen;\r
+ PFNREAD pfnread;\r
+ PFNWRITE pfnwrite;\r
+ PFNCLOSE pfnclose;\r
+ PFNSEEK pfnseek;\r
+ PERF perf;\r
+} FDI_Int, *PFDI_Int;\r
+\r
+/* cast an HFCI into a PFCI_Int */\r
+#define PFCI_INT(hfci) ((PFDI_Int)(hfci))\r
+\r
+/* cast an HFDI into a PFDI_Int */\r
+#define PFDI_INT(hfdi) ((PFDI_Int)(hfdi))\r
+\r
+/* quickie pfdi method invokers */\r
+#define PFDI_ALLOC(hfdi, size) ((*PFDI_INT(hfdi)->pfnalloc) (size))\r
+#define PFDI_FREE(hfdi, ptr) ((*PFDI_INT(hfdi)->pfnfree) (ptr))\r
+#define PFDI_OPEN(hfdi, file, flag, mode) ((*PFDI_INT(hfdi)->pfnopen) (file, flag, mode))\r
+#define PFDI_READ(hfdi, hf, pv, cb) ((*PFDI_INT(hfdi)->pfnread) (hf, pv, cb))\r
+#define PFDI_WRITE(hfdi, hf, pv, cb) ((*PFDI_INT(hfdi)->pfnwrite) (hf, pv, cb))\r
+#define PFDI_CLOSE(hfdi, hf) ((*PFDI_INT(hfdi)->pfnclose) (hf))\r
+#define PFDI_SEEK(hfdi, hf, dist, type) ((*PFDI_INT(hfdi)->pfnseek) (hf, dist, type))\r
+\r
+#define FCI_INT_MAGIC 0xfcfcfc05\r
+#define FDI_INT_MAGIC 0xfdfdfd05\r
+\r
+#define REALLY_IS_FCI(hfci) ( \\r
+ (((void *) hfci) != NULL) && \\r
+ (PFCI_INT(hfci)->FCI_Intmagic == FCI_INT_MAGIC) )\r
+\r
+#define REALLY_IS_FDI(hfdi) ( \\r
+ (((void *) hfdi) != NULL) && \\r
+ (PFDI_INT(hfdi)->FDI_Intmagic == FDI_INT_MAGIC) )\r
+\r
+/*\r
+ * the rest of these are somewhat kludgy macros which are shared between fdi.c\r
+ * and cabextract.c.\r
+ */\r
+\r
+#define ZIPNEEDBITS(n) {while(k<(n)){cab_LONG c=*(ZIP(inpos)++);\\r
+ b|=((cab_ULONG)c)<<k;k+=8;}}\r
+#define ZIPDUMPBITS(n) {b>>=(n);k-=(n);}\r
+\r
+/* endian-neutral reading of little-endian data */\r
+#define EndGetI32(a) ((((a)[3])<<24)|(((a)[2])<<16)|(((a)[1])<<8)|((a)[0]))\r
+#define EndGetI16(a) ((((a)[1])<<8)|((a)[0]))\r
+\r
+#define CAB(x) (decomp_state->x)\r
+#define ZIP(x) (decomp_state->methods.zip.x)\r
+#define QTM(x) (decomp_state->methods.qtm.x)\r
+#define LZX(x) (decomp_state->methods.lzx.x)\r
+#define DECR_OK (0)\r
+#define DECR_DATAFORMAT (1)\r
+#define DECR_ILLEGALDATA (2)\r
+#define DECR_NOMEMORY (3)\r
+#define DECR_CHECKSUM (4)\r
+#define DECR_INPUT (5)\r
+#define DECR_OUTPUT (6)\r
+#define DECR_USERABORT (7)\r
+\r
+/* Bitstream reading macros (Quantum / normal byte order)\r
+ *\r
+ * Q_INIT_BITSTREAM should be used first to set up the system\r
+ * Q_READ_BITS(var,n) takes N bits from the buffer and puts them in var.\r
+ * unlike LZX, this can loop several times to get the\r
+ * requisite number of bits.\r
+ * Q_FILL_BUFFER adds more data to the bit buffer, if there is room\r
+ * for another 16 bits.\r
+ * Q_PEEK_BITS(n) extracts (without removing) N bits from the bit\r
+ * buffer\r
+ * Q_REMOVE_BITS(n) removes N bits from the bit buffer\r
+ *\r
+ * These bit access routines work by using the area beyond the MSB and the\r
+ * LSB as a free source of zeroes. This avoids having to mask any bits.\r
+ * So we have to know the bit width of the bitbuffer variable. This is\r
+ * defined as ULONG_BITS.\r
+ *\r
+ * ULONG_BITS should be at least 16 bits. Unlike LZX's Huffman decoding,\r
+ * Quantum's arithmetic decoding only needs 1 bit at a time, it doesn't\r
+ * need an assured number. Retrieving larger bitstrings can be done with\r
+ * multiple reads and fills of the bitbuffer. The code should work fine\r
+ * for machines where ULONG >= 32 bits.\r
+ *\r
+ * Also note that Quantum reads bytes in normal order; LZX is in\r
+ * little-endian order.\r
+ */\r
+\r
+#define Q_INIT_BITSTREAM do { bitsleft = 0; bitbuf = 0; } while (0)\r
+\r
+#define Q_FILL_BUFFER do { \\r
+ if (bitsleft <= (CAB_ULONG_BITS - 16)) { \\r
+ bitbuf |= ((inpos[0]<<8)|inpos[1]) << (CAB_ULONG_BITS-16 - bitsleft); \\r
+ bitsleft += 16; inpos += 2; \\r
+ } \\r
+} while (0)\r
+\r
+#define Q_PEEK_BITS(n) (bitbuf >> (CAB_ULONG_BITS - (n)))\r
+#define Q_REMOVE_BITS(n) ((bitbuf <<= (n)), (bitsleft -= (n)))\r
+\r
+#define Q_READ_BITS(v,n) do { \\r
+ (v) = 0; \\r
+ for (bitsneed = (n); bitsneed; bitsneed -= bitrun) { \\r
+ Q_FILL_BUFFER; \\r
+ bitrun = (bitsneed > bitsleft) ? bitsleft : bitsneed; \\r
+ (v) = ((v) << bitrun) | Q_PEEK_BITS(bitrun); \\r
+ Q_REMOVE_BITS(bitrun); \\r
+ } \\r
+} while (0)\r
+\r
+#define Q_MENTRIES(model) (QTM(model).entries)\r
+#define Q_MSYM(model,symidx) (QTM(model).syms[(symidx)].sym)\r
+#define Q_MSYMFREQ(model,symidx) (QTM(model).syms[(symidx)].cumfreq)\r
+\r
+/* GET_SYMBOL(model, var) fetches the next symbol from the stated model\r
+ * and puts it in var. it may need to read the bitstream to do this.\r
+ */\r
+#define GET_SYMBOL(m, var) do { \\r
+ range = ((H - L) & 0xFFFF) + 1; \\r
+ symf = ((((C - L + 1) * Q_MSYMFREQ(m,0)) - 1) / range) & 0xFFFF; \\r
+ \\r
+ for (i=1; i < Q_MENTRIES(m); i++) { \\r
+ if (Q_MSYMFREQ(m,i) <= symf) break; \\r
+ } \\r
+ (var) = Q_MSYM(m,i-1); \\r
+ \\r
+ range = (H - L) + 1; \\r
+ H = L + ((Q_MSYMFREQ(m,i-1) * range) / Q_MSYMFREQ(m,0)) - 1; \\r
+ L = L + ((Q_MSYMFREQ(m,i) * range) / Q_MSYMFREQ(m,0)); \\r
+ while (1) { \\r
+ if ((L & 0x8000) != (H & 0x8000)) { \\r
+ if ((L & 0x4000) && !(H & 0x4000)) { \\r
+ /* underflow case */ \\r
+ C ^= 0x4000; L &= 0x3FFF; H |= 0x4000; \\r
+ } \\r
+ else break; \\r
+ } \\r
+ L <<= 1; H = (H << 1) | 1; \\r
+ Q_FILL_BUFFER; \\r
+ C = (C << 1) | Q_PEEK_BITS(1); \\r
+ Q_REMOVE_BITS(1); \\r
+ } \\r
+ \\r
+ QTMupdatemodel(&(QTM(m)), i); \\r
+} while (0)\r
+\r
+/* Bitstream reading macros (LZX / intel little-endian byte order)\r
+ *\r
+ * INIT_BITSTREAM should be used first to set up the system\r
+ * READ_BITS(var,n) takes N bits from the buffer and puts them in var\r
+ *\r
+ * ENSURE_BITS(n) ensures there are at least N bits in the bit buffer.\r
+ * it can guarantee up to 17 bits (i.e. it can read in\r
+ * 16 new bits when there is down to 1 bit in the buffer,\r
+ * and it can read 32 bits when there are 0 bits in the\r
+ * buffer).\r
+ * PEEK_BITS(n) extracts (without removing) N bits from the bit buffer\r
+ * REMOVE_BITS(n) removes N bits from the bit buffer\r
+ *\r
+ * These bit access routines work by using the area beyond the MSB and the\r
+ * LSB as a free source of zeroes. This avoids having to mask any bits.\r
+ * So we have to know the bit width of the bitbuffer variable.\r
+ */\r
+\r
+#define INIT_BITSTREAM do { bitsleft = 0; bitbuf = 0; } while (0)\r
+\r
+/* Quantum reads bytes in normal order; LZX is little-endian order */\r
+#define ENSURE_BITS(n) \\r
+ while (bitsleft < (n)) { \\r
+ bitbuf |= ((inpos[1]<<8)|inpos[0]) << (CAB_ULONG_BITS-16 - bitsleft); \\r
+ bitsleft += 16; inpos+=2; \\r
+ }\r
+\r
+#define PEEK_BITS(n) (bitbuf >> (CAB_ULONG_BITS - (n)))\r
+#define REMOVE_BITS(n) ((bitbuf <<= (n)), (bitsleft -= (n)))\r
+\r
+#define READ_BITS(v,n) do { \\r
+ if (n) { \\r
+ ENSURE_BITS(n); \\r
+ (v) = PEEK_BITS(n); \\r
+ REMOVE_BITS(n); \\r
+ } \\r
+ else { \\r
+ (v) = 0; \\r
+ } \\r
+} while (0)\r
+\r
+/* Huffman macros */\r
+\r
+#define TABLEBITS(tbl) (LZX_##tbl##_TABLEBITS)\r
+#define MAXSYMBOLS(tbl) (LZX_##tbl##_MAXSYMBOLS)\r
+#define SYMTABLE(tbl) (LZX(tbl##_table))\r
+#define LENTABLE(tbl) (LZX(tbl##_len))\r
+\r
+/* BUILD_TABLE(tablename) builds a huffman lookup table from code lengths.\r
+ * In reality, it just calls make_decode_table() with the appropriate\r
+ * values - they're all fixed by some #defines anyway, so there's no point\r
+ * writing each call out in full by hand.\r
+ */\r
+#define BUILD_TABLE(tbl) \\r
+ if (make_decode_table( \\r
+ MAXSYMBOLS(tbl), TABLEBITS(tbl), LENTABLE(tbl), SYMTABLE(tbl) \\r
+ )) { return DECR_ILLEGALDATA; }\r
+\r
+/* READ_HUFFSYM(tablename, var) decodes one huffman symbol from the\r
+ * bitstream using the stated table and puts it in var.\r
+ */\r
+#define READ_HUFFSYM(tbl,var) do { \\r
+ ENSURE_BITS(16); \\r
+ hufftbl = SYMTABLE(tbl); \\r
+ if ((i = hufftbl[PEEK_BITS(TABLEBITS(tbl))]) >= MAXSYMBOLS(tbl)) { \\r
+ j = 1 << (CAB_ULONG_BITS - TABLEBITS(tbl)); \\r
+ do { \\r
+ j >>= 1; i <<= 1; i |= (bitbuf & j) ? 1 : 0; \\r
+ if (!j) { return DECR_ILLEGALDATA; } \\r
+ } while ((i = hufftbl[i]) >= MAXSYMBOLS(tbl)); \\r
+ } \\r
+ j = LENTABLE(tbl)[(var) = i]; \\r
+ REMOVE_BITS(j); \\r
+} while (0)\r
+\r
+/* READ_LENGTHS(tablename, first, last) reads in code lengths for symbols\r
+ * first to last in the given table. The code lengths are stored in their\r
+ * own special LZX way.\r
+ */\r
+#define READ_LENGTHS(tbl,first,last,fn) do { \\r
+ lb.bb = bitbuf; lb.bl = bitsleft; lb.ip = inpos; \\r
+ if (fn(LENTABLE(tbl),(first),(last),&lb,decomp_state)) { \\r
+ return DECR_ILLEGALDATA; \\r
+ } \\r
+ bitbuf = lb.bb; bitsleft = lb.bl; inpos = lb.ip; \\r
+} while (0)\r
+\r
+/* Tables for deflate from PKZIP's appnote.txt. */\r
+\r
+#define THOSE_ZIP_CONSTS \\r
+static const cab_UBYTE Zipborder[] = /* Order of the bit length code lengths */ \\r
+{ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15}; \\r
+static const cab_UWORD Zipcplens[] = /* Copy lengths for literal codes 257..285 */ \\r
+{ 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, \\r
+ 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0}; \\r
+static const cab_UWORD Zipcplext[] = /* Extra bits for literal codes 257..285 */ \\r
+{ 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, \\r
+ 4, 5, 5, 5, 5, 0, 99, 99}; /* 99==invalid */ \\r
+static const cab_UWORD Zipcpdist[] = /* Copy offsets for distance codes 0..29 */ \\r
+{ 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, \\r
+513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577}; \\r
+static const cab_UWORD Zipcpdext[] = /* Extra bits for distance codes */ \\r
+{ 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, \\r
+10, 11, 11, 12, 12, 13, 13}; \\r
+/* And'ing with Zipmask[n] masks the lower n bits */ \\r
+static const cab_UWORD Zipmask[17] = { \\r
+ 0x0000, 0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff, \\r
+ 0x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff \\r
+}\r
+\r
+struct ExtractFileList {\r
+ LPSTR filename;\r
+ struct ExtractFileList *next;\r
+ BOOL unknown; /* always 1L */\r
+} ;\r
+\r
+/* the first parameter of the function extract */\r
+typedef struct {\r
+ long result1; /* 0x000 */\r
+ long unknown1[3]; /* 0x004 */\r
+ struct ExtractFileList *filelist; /* 0x010 */\r
+ long filecount; /* 0x014 */\r
+ long unknown2; /* 0x018 */\r
+ char directory[0x104]; /* 0x01c */\r
+ char lastfile[0x20c]; /* 0x120 */\r
+} EXTRACTdest;\r
+\r
+\r
+/* from cabextract.c */\r
+BOOL process_cabinet(LPCSTR cabname, LPCSTR dir, BOOL fix, BOOL lower, EXTRACTdest *dest);\r
+void QTMupdatemodel(struct QTMmodel *model, int sym);\r
+int make_decode_table(cab_ULONG nsyms, cab_ULONG nbits, cab_UBYTE *length, cab_UWORD *table);\r
+cab_ULONG checksum(cab_UBYTE *data, cab_UWORD bytes, cab_ULONG csum);\r
+\r
+#endif /* __WINE_CABINET_H */\r
--- /dev/null
+/* Language neutral resources.\r
+ *\r
+ * Copyright 2003 Stefan Leichter\r
+ *\r
+ * This library is free software; you can redistribute it and/or\r
+ * modify it under the terms of the GNU Lesser General Public\r
+ * License as published by the Free Software Foundation; either\r
+ * version 2.1 of the License, or (at your option) any later version.\r
+ *\r
+ * This library is distributed in the hope that it will be useful,\r
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of\r
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r
+ * Lesser General Public License for more details.\r
+ *\r
+ * You should have received a copy of the GNU Lesser General Public\r
+ * License along with this library; if not, write to the Free Software\r
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\r
+ */\r
+\r
+#define WINE_FILEDESCRIPTION_STR "Wine Cabinet File API"\r
+#define WINE_FILENAME_STR "cabinet.dll"\r
+#define WINE_FILEVERSION 5,0,2147,1\r
+#define WINE_FILEVERSION_STR "5.0.2147.1"\r
+\r
+#define WINE_PRODUCTVERSION 5,0,2147,1\r
+#define WINE_PRODUCTVERSION_STR "5.0"\r
+\r
+#include "wine/wine_common_ver.rc"\r
--- /dev/null
+1 stub GetDllVersion\r
+2 stdcall DllGetVersion (ptr) CABINET_DllGetVersion\r
+3 stdcall Extract(ptr str)\r
+4 stub DeleteExtractedFiles\r
+10 cdecl FCICreate(ptr ptr ptr ptr ptr ptr ptr ptr ptr ptr ptr ptr ptr)\r
+11 cdecl FCIAddFile(long ptr ptr long ptr ptr ptr long)\r
+12 cdecl FCIFlushFolder(long ptr ptr)\r
+13 cdecl FCIFlushCabinet(long long ptr ptr)\r
+14 cdecl FCIDestroy(long)\r
+20 cdecl FDICreate(ptr ptr ptr ptr ptr ptr ptr long ptr)\r
+21 cdecl FDIIsCabinet(long long ptr)\r
+22 cdecl FDICopy(long ptr ptr long ptr ptr ptr)\r
+23 cdecl FDIDestroy(long)\r
+24 cdecl FDITruncateCabinet(long ptr long)\r
--- /dev/null
+/*\r
+ * cabinet.dll main\r
+ *\r
+ * Copyright 2002 Patrik Stridvall\r
+ *\r
+ * This library is free software; you can redistribute it and/or\r
+ * modify it under the terms of the GNU Lesser General Public\r
+ * License as published by the Free Software Foundation; either\r
+ * version 2.1 of the License, or (at your option) any later version.\r
+ *\r
+ * This library is distributed in the hope that it will be useful,\r
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of\r
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r
+ * Lesser General Public License for more details.\r
+ *\r
+ * You should have received a copy of the GNU Lesser General Public\r
+ * License along with this library; if not, write to the Free Software\r
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\r
+ */\r
+\r
+#include "config.h"\r
+\r
+#include <assert.h>\r
+#include <stdarg.h>\r
+#include <string.h>\r
+\r
+#include "windef.h"\r
+#include "winbase.h"\r
+#include "winerror.h"\r
+#define NO_SHLWAPI_REG\r
+#include "shlwapi.h"\r
+#undef NO_SHLWAPI_REG\r
+\r
+#include "cabinet.h"\r
+\r
+#include "wine/debug.h"\r
+\r
+WINE_DEFAULT_DEBUG_CHANNEL(cabinet);\r
+\r
+/***********************************************************************\r
+ * DllGetVersion (CABINET.2)\r
+ *\r
+ * Retrieves version information of the 'CABINET.DLL'\r
+ *\r
+ * PARAMS\r
+ * pdvi [O] pointer to version information structure.\r
+ *\r
+ * RETURNS\r
+ * Success: S_OK\r
+ * Failure: E_INVALIDARG\r
+ *\r
+ * NOTES\r
+ * Supposedly returns version from IE6SP1RP1\r
+ */\r
+HRESULT WINAPI CABINET_DllGetVersion (DLLVERSIONINFO *pdvi)\r
+{\r
+ WARN("hmmm... not right version number \"5.1.1106.1\"?\n");\r
+\r
+ if (pdvi->cbSize != sizeof(DLLVERSIONINFO)) return E_INVALIDARG;\r
+\r
+ pdvi->dwMajorVersion = 5;\r
+ pdvi->dwMinorVersion = 1;\r
+ pdvi->dwBuildNumber = 1106;\r
+ pdvi->dwPlatformID = 1;\r
+\r
+ return S_OK;\r
+}\r
+\r
+/***********************************************************************\r
+ * Extract (CABINET.3)\r
+ *\r
+ * Apparently an undocumented function, presumably to extract a CAB file\r
+ * to somewhere...\r
+ *\r
+ * PARAMS\r
+ * dest pointer to a buffer of 0x32c bytes containing\r
+ * [I] - number with value 1 at index 0x18\r
+ * - the dest path starting at index 0x1c\r
+ * [O] - a linked list with the filename existing inside the\r
+ * CAB file at idx 0x10\r
+ * - the number of files inside the CAB file at index 0x14\r
+ * - the name of the last file with dest path at idx 0x120\r
+ * what [I] char* describing what to uncompress, I guess.\r
+ *\r
+ * RETURNS\r
+ * Success: S_OK\r
+ * Failure: E_OUTOFMEMORY (?)\r
+ */\r
+HRESULT WINAPI Extract(EXTRACTdest *dest, LPCSTR what)\r
+{\r
+#define DUMPC(idx) idx >= sizeof(EXTRACTdest) ? ' ' : \\r
+ ptr[idx] >= 0x20 ? ptr[idx] : '.'\r
+\r
+#define DUMPH(idx) idx >= sizeof(EXTRACTdest) ? 0x55 : ptr[idx]\r
+\r
+ LPSTR dir;\r
+ unsigned char *ptr = (unsigned char*) dest;\r
+ unsigned int i;\r
+\r
+ TRACE("(dest == %0lx, what == %s)\n", (long) dest, debugstr_a(what));\r
+\r
+ if (!dest) {\r
+ /* win2k will crash here */\r
+ FIXME("called without valid parameter dest!\n");\r
+ return E_OUTOFMEMORY;\r
+ }\r
+ for (i=0; i < sizeof(EXTRACTdest); i+=8)\r
+ TRACE( "dest[%04x]:%02x %02x %02x %02x %02x %02x %02x %02x %c%c%c%c%c%c%c%c\n",\r
+ i,\r
+ DUMPH(i+0), DUMPH(i+1), DUMPH(i+2), DUMPH(i+3),\r
+ DUMPH(i+4), DUMPH(i+5), DUMPH(i+6), DUMPH(i+7),\r
+ DUMPC(i+0), DUMPC(i+1), DUMPC(i+2), DUMPC(i+3),\r
+ DUMPC(i+4), DUMPC(i+5), DUMPC(i+6), DUMPC(i+7));\r
+\r
+ dir = LocalAlloc(LPTR, strlen(dest->directory)+1); \r
+ if (!dir) return E_OUTOFMEMORY;\r
+ lstrcpyA(dir, dest->directory);\r
+ dest->filecount=0;\r
+ dest->filelist = NULL;\r
+\r
+ TRACE("extracting to dir: %s\n", debugstr_a(dir));\r
+\r
+ /* FIXME: what to do on failure? */\r
+ if (!process_cabinet(what, dir, FALSE, FALSE, dest))\r
+ return E_OUTOFMEMORY;\r
+\r
+ LocalFree(dir);\r
+\r
+ TRACE("filecount %08lx,lastfile %s\n",\r
+ dest->filecount, debugstr_a(dest->lastfile));\r
+\r
+ return S_OK;\r
+}\r
--- /dev/null
+/*\r
+ * File Compression Interface\r
+ *\r
+ * Copyright 2002 Patrik Stridvall\r
+ *\r
+ * This library is free software; you can redistribute it and/or\r
+ * modify it under the terms of the GNU Lesser General Public\r
+ * License as published by the Free Software Foundation; either\r
+ * version 2.1 of the License, or (at your option) any later version.\r
+ *\r
+ * This library is distributed in the hope that it will be useful,\r
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of\r
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r
+ * Lesser General Public License for more details.\r
+ *\r
+ * You should have received a copy of the GNU Lesser General Public\r
+ * License along with this library; if not, write to the Free Software\r
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\r
+ */\r
+\r
+#include "config.h"\r
+\r
+#include <stdarg.h>\r
+\r
+#include "windef.h"\r
+#include "winbase.h"\r
+#include "winerror.h"\r
+#include "fci.h"\r
+\r
+#include "wine/debug.h"\r
+\r
+WINE_DEFAULT_DEBUG_CHANNEL(cabinet);\r
+\r
+/***********************************************************************\r
+ * FCICreate (CABINET.10)\r
+ */\r
+HFCI __cdecl FCICreate(\r
+ PERF perf,\r
+ PFNFCIFILEPLACED pfnfcifp,\r
+ PFNFCIALLOC pfna,\r
+ PFNFCIFREE pfnf,\r
+ PFNFCIOPEN pfnopen,\r
+ PFNFCIREAD pfnread,\r
+ PFNFCIWRITE pfnwrite,\r
+ PFNFCICLOSE pfnclose,\r
+ PFNFCISEEK pfnseek,\r
+ PFNFCIDELETE pfndelete,\r
+ PFNFCIGETTEMPFILE pfnfcigtf,\r
+ PCCAB pccab,\r
+ void *pv)\r
+{\r
+ FIXME("(%p, %p, %p, %p, %p, %p, %p, %p, %p, %p, %p, %p, %p): stub\n",\r
+ perf, pfnfcifp, pfna, pfnf, pfnopen, pfnread, pfnwrite, pfnclose,\r
+ pfnseek, pfndelete, pfnfcigtf, pccab, pv);\r
+\r
+ perf->erfOper = FCIERR_NONE;\r
+ perf->erfType = 0;\r
+ perf->fError = TRUE;\r
+\r
+ SetLastError(ERROR_CALL_NOT_IMPLEMENTED);\r
+\r
+ return NULL;\r
+}\r
+\r
+/***********************************************************************\r
+ * FCIAddFile (CABINET.11)\r
+ */\r
+BOOL __cdecl FCIAddFile(\r
+ HFCI hfci,\r
+ char *pszSourceFile,\r
+ char *pszFileName,\r
+ BOOL fExecute,\r
+ PFNFCIGETNEXTCABINET pfnfcignc,\r
+ PFNFCISTATUS pfnfcis,\r
+ PFNFCIGETOPENINFO pfnfcigoi,\r
+ TCOMP typeCompress)\r
+{\r
+ FIXME("(%p, %p, %p, %d, %p, %p, %p, %hu): stub\n", hfci, pszSourceFile,\r
+ pszFileName, fExecute, pfnfcignc, pfnfcis, pfnfcigoi, typeCompress);\r
+\r
+ SetLastError(ERROR_CALL_NOT_IMPLEMENTED);\r
+\r
+ return FALSE;\r
+}\r
+\r
+/***********************************************************************\r
+ * FCIFlushCabinet (CABINET.13)\r
+ */\r
+BOOL __cdecl FCIFlushCabinet(\r
+ HFCI hfci,\r
+ BOOL fGetNextCab,\r
+ PFNFCIGETNEXTCABINET pfnfcignc,\r
+ PFNFCISTATUS pfnfcis)\r
+{\r
+ FIXME("(%p, %d, %p, %p): stub\n", hfci, fGetNextCab, pfnfcignc, pfnfcis);\r
+\r
+ SetLastError(ERROR_CALL_NOT_IMPLEMENTED);\r
+\r
+ return FALSE;\r
+}\r
+\r
+/***********************************************************************\r
+ * FCIFlushFolder (CABINET.12)\r
+ */\r
+BOOL __cdecl FCIFlushFolder(\r
+ HFCI hfci,\r
+ PFNFCIGETNEXTCABINET pfnfcignc,\r
+ PFNFCISTATUS pfnfcis)\r
+{\r
+ FIXME("(%p, %p, %p): stub\n", hfci, pfnfcignc, pfnfcis);\r
+\r
+ SetLastError(ERROR_CALL_NOT_IMPLEMENTED);\r
+\r
+ return FALSE;\r
+}\r
+\r
+/***********************************************************************\r
+ * FCIDestroy (CABINET.14)\r
+ */\r
+BOOL __cdecl FCIDestroy(HFCI hfci)\r
+{\r
+ FIXME("(%p): stub\n", hfci);\r
+\r
+ SetLastError(ERROR_CALL_NOT_IMPLEMENTED);\r
+\r
+ return FALSE;\r
+}\r
--- /dev/null
+/*\r
+ * File Decompression Interface\r
+ *\r
+ * Copyright 2000-2002 Stuart Caie\r
+ * Copyright 2002 Patrik Stridvall\r
+ * Copyright 2003 Greg Turner\r
+ *\r
+ * This library is free software; you can redistribute it and/or\r
+ * modify it under the terms of the GNU Lesser General Public\r
+ * License as published by the Free Software Foundation; either\r
+ * version 2.1 of the License, or (at your option) any later version.\r
+ *\r
+ * This library is distributed in the hope that it will be useful,\r
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of\r
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r
+ * Lesser General Public License for more details.\r
+ *\r
+ * You should have received a copy of the GNU Lesser General Public\r
+ * License along with this library; if not, write to the Free Software\r
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\r
+ *\r
+ *\r
+ * This is a largely redundant reimplementation of the stuff in cabextract.c. It\r
+ * would be theoretically preferable to have only one, shared implementation, however\r
+ * there are semantic differences which may discourage efforts to unify the two. It\r
+ * should be possible, if awkward, to go back and reimplement cabextract.c using FDI.\r
+ * But this approach would be quite a bit less performant. Probably a better way\r
+ * would be to create a "library" of routines in cabextract.c which do the actual\r
+ * decompression, and have both fdi.c and cabextract share those routines. The rest\r
+ * of the code is not sufficiently similar to merit a shared implementation.\r
+ *\r
+ * The worst thing about this API is the bug. "The bug" is this: when you extract a\r
+ * cabinet, it /always/ informs you (via the hasnext field of PFDICABINETINFO), that\r
+ * there is no subsequent cabinet, even if there is one. wine faithfully reproduces\r
+ * this behavior.\r
+ *\r
+ * TODO:\r
+ *\r
+ * Wine does not implement the AFAIK undocumented "enumerate" callback during\r
+ * FDICopy. It is implemented in Windows and therefore worth investigating...\r
+ *\r
+ * Lots of pointers flying around here... am I leaking RAM?\r
+ *\r
+ * WTF is FDITruncate?\r
+ *\r
+ * Probably, I need to weed out some dead code-paths.\r
+ *\r
+ * Test unit(s).\r
+ *\r
+ * The fdintNEXT_CABINET callbacks are probably not working quite as they should.\r
+ * There are several FIXME's in the source describing some of the deficiencies in\r
+ * some detail. Additionally, we do not do a very good job of returning the right\r
+ * error codes to this callback.\r
+ *\r
+ * FDICopy and fdi_decomp are incomprehensibly large; separating these into smaller\r
+ * functions would be nice.\r
+ *\r
+ * -gmt\r
+ */\r
+\r
+#include "config.h"\r
+\r
+#include <stdarg.h>\r
+#include <stdio.h>\r
+\r
+#include "windef.h"\r
+#include "winbase.h"\r
+#include "winerror.h"\r
+#include "fdi.h"\r
+#include "cabinet.h"\r
+\r
+#include "wine/debug.h"\r
+\r
+WINE_DEFAULT_DEBUG_CHANNEL(cabinet);\r
+\r
+THOSE_ZIP_CONSTS;\r
+\r
+struct fdi_file {\r
+ struct fdi_file *next; /* next file in sequence */\r
+ LPCSTR filename; /* output name of file */\r
+ int fh; /* open file handle or NULL */\r
+ cab_ULONG length; /* uncompressed length of file */\r
+ cab_ULONG offset; /* uncompressed offset in folder */\r
+ cab_UWORD index; /* magic index number of folder */\r
+ cab_UWORD time, date, attribs; /* MS-DOS time/date/attributes */\r
+ BOOL oppressed; /* never to be processed */\r
+};\r
+\r
+struct fdi_folder {\r
+ struct fdi_folder *next;\r
+ cab_off_t offset; /* offset to data blocks (32 bit) */\r
+ cab_UWORD comp_type; /* compression format/window size */\r
+ cab_ULONG comp_size; /* compressed size of folder */\r
+ cab_UBYTE num_splits; /* number of split blocks + 1 */\r
+ cab_UWORD num_blocks; /* total number of blocks */\r
+};\r
+\r
+/*\r
+ * this structure fills the gaps between what is available in a PFDICABINETINFO\r
+ * vs what is needed by FDICopy. Memory allocated for these becomes the responsibility\r
+ * of the caller to free. Yes, I am aware that this is totally, utterly inelegant.\r
+ * To make things even more unnecessarily confusing, we now attach these to the\r
+ * fdi_decomp_state.\r
+ */\r
+typedef struct {\r
+ char *prevname, *previnfo;\r
+ char *nextname, *nextinfo;\r
+ BOOL hasnext; /* bug free indicator */\r
+ int folder_resv, header_resv;\r
+ cab_UBYTE block_resv;\r
+} MORE_ISCAB_INFO, *PMORE_ISCAB_INFO;\r
+\r
+/*\r
+ * ugh, well, this ended up being pretty damn silly...\r
+ * now that I've conceded to build equivalent structures to struct cab.*,\r
+ * I should have just used those, or, better yet, unified the two... sue me.\r
+ * (Note to Microsoft: That's a joke. Please /don't/ actually sue me! -gmt).\r
+ * Nevertheless, I've come this far, it works, so I'm not gonna change it\r
+ * for now. This implementation has significant semantic differences anyhow.\r
+ */\r
+\r
+typedef struct fdi_cds_fwd {\r
+ void *hfdi; /* the hfdi we are using */\r
+ int filehf, cabhf; /* file handle we are using */\r
+ struct fdi_folder *current; /* current folder we're extracting from */\r
+ cab_ULONG offset; /* uncompressed offset within folder */\r
+ cab_UBYTE *outpos; /* (high level) start of data to use up */\r
+ cab_UWORD outlen; /* (high level) amount of data to use up */\r
+ int (*decompress)(int, int, struct fdi_cds_fwd *); /* chosen compress fn */\r
+ cab_UBYTE inbuf[CAB_INPUTMAX+2]; /* +2 for lzx bitbuffer overflows! */\r
+ cab_UBYTE outbuf[CAB_BLOCKMAX];\r
+ union {\r
+ struct ZIPstate zip;\r
+ struct QTMstate qtm;\r
+ struct LZXstate lzx;\r
+ } methods;\r
+ /* some temp variables for use during decompression */\r
+ cab_UBYTE q_length_base[27], q_length_extra[27], q_extra_bits[42];\r
+ cab_ULONG q_position_base[42];\r
+ cab_ULONG lzx_position_base[51];\r
+ cab_UBYTE extra_bits[51];\r
+ USHORT setID; /* Cabinet set ID */\r
+ USHORT iCabinet; /* Cabinet number in set (0 based) */\r
+ struct fdi_cds_fwd *decomp_cab;\r
+ MORE_ISCAB_INFO mii;\r
+ struct fdi_folder *firstfol; \r
+ struct fdi_file *firstfile;\r
+ struct fdi_cds_fwd *next;\r
+} fdi_decomp_state;\r
+\r
+/***********************************************************************\r
+ * FDICreate (CABINET.20)\r
+ *\r
+ * Provided with several callbacks (all of them are mandatory),\r
+ * returns a handle which can be used to perform operations\r
+ * on cabinet files.\r
+ *\r
+ * PARAMS\r
+ * pfnalloc [I] A pointer to a function which allocates ram. Uses\r
+ * the same interface as malloc.\r
+ * pfnfree [I] A pointer to a function which frees ram. Uses the\r
+ * same interface as free.\r
+ * pfnopen [I] A pointer to a function which opens a file. Uses\r
+ * the same interface as _open.\r
+ * pfnread [I] A pointer to a function which reads from a file into\r
+ * a caller-provided buffer. Uses the same interface\r
+ * as _read\r
+ * pfnwrite [I] A pointer to a function which writes to a file from\r
+ * a caller-provided buffer. Uses the same interface\r
+ * as _write.\r
+ * pfnclose [I] A pointer to a function which closes a file handle.\r
+ * Uses the same interface as _close.\r
+ * pfnseek [I] A pointer to a function which seeks in a file.\r
+ * Uses the same interface as _lseek.\r
+ * cpuType [I] The type of CPU; ignored in wine (recommended value:\r
+ * cpuUNKNOWN, aka -1).\r
+ * perf [IO] A pointer to an ERF structure. When FDICreate\r
+ * returns an error condition, error information may\r
+ * be found here as well as from GetLastError.\r
+ *\r
+ * RETURNS\r
+ * On success, returns an FDI handle of type HFDI.\r
+ * On failure, the NULL file handle is returned. Error\r
+ * info can be retrieved from perf.\r
+ *\r
+ * INCLUDES\r
+ * fdi.h\r
+ * \r
+ */\r
+HFDI __cdecl FDICreate(\r
+ PFNALLOC pfnalloc,\r
+ PFNFREE pfnfree,\r
+ PFNOPEN pfnopen,\r
+ PFNREAD pfnread,\r
+ PFNWRITE pfnwrite,\r
+ PFNCLOSE pfnclose,\r
+ PFNSEEK pfnseek,\r
+ int cpuType,\r
+ PERF perf)\r
+{\r
+ HFDI rv;\r
+\r
+ TRACE("(pfnalloc == ^%p, pfnfree == ^%p, pfnopen == ^%p, pfnread == ^%p, pfnwrite == ^%p, \\r
+ pfnclose == ^%p, pfnseek == ^%p, cpuType == %d, perf == ^%p)\n", \r
+ pfnalloc, pfnfree, pfnopen, pfnread, pfnwrite, pfnclose, pfnseek,\r
+ cpuType, perf);\r
+\r
+ if ((!pfnalloc) || (!pfnfree)) {\r
+ perf->erfOper = FDIERROR_NONE;\r
+ perf->erfType = ERROR_BAD_ARGUMENTS;\r
+ perf->fError = TRUE;\r
+\r
+ SetLastError(ERROR_BAD_ARGUMENTS);\r
+ return NULL;\r
+ }\r
+\r
+ if (!((rv = ((HFDI) (*pfnalloc)(sizeof(FDI_Int)))))) {\r
+ perf->erfOper = FDIERROR_ALLOC_FAIL;\r
+ perf->erfType = ERROR_NOT_ENOUGH_MEMORY;\r
+ perf->fError = TRUE;\r
+\r
+ SetLastError(ERROR_NOT_ENOUGH_MEMORY);\r
+ return NULL;\r
+ }\r
+ \r
+ PFDI_INT(rv)->FDI_Intmagic = FDI_INT_MAGIC;\r
+ PFDI_INT(rv)->pfnalloc = pfnalloc;\r
+ PFDI_INT(rv)->pfnfree = pfnfree;\r
+ PFDI_INT(rv)->pfnopen = pfnopen;\r
+ PFDI_INT(rv)->pfnread = pfnread;\r
+ PFDI_INT(rv)->pfnwrite = pfnwrite;\r
+ PFDI_INT(rv)->pfnclose = pfnclose;\r
+ PFDI_INT(rv)->pfnseek = pfnseek;\r
+ /* no-brainer: we ignore the cpu type; this is only used\r
+ for the 16-bit versions in Windows anyhow... */\r
+ PFDI_INT(rv)->perf = perf;\r
+\r
+ return rv;\r
+}\r
+\r
+/*******************************************************************\r
+ * FDI_getoffset (internal)\r
+ *\r
+ * returns the file pointer position of a file handle.\r
+ */\r
+long FDI_getoffset(HFDI hfdi, INT_PTR hf)\r
+{\r
+ return PFDI_SEEK(hfdi, hf, 0L, SEEK_CUR);\r
+}\r
+\r
+/**********************************************************************\r
+ * FDI_realloc (internal)\r
+ *\r
+ * we can't use _msize; the user might not be using malloc, so we require\r
+ * an explicit specification of the previous size. inefficient.\r
+ */\r
+void *FDI_realloc(HFDI hfdi, void *mem, size_t prevsize, size_t newsize)\r
+{\r
+ void *rslt = NULL;\r
+ char *irslt, *imem;\r
+ size_t copysize = (prevsize < newsize) ? prevsize : newsize;\r
+ if (prevsize == newsize) return mem;\r
+ rslt = PFDI_ALLOC(hfdi, newsize); \r
+ if (rslt)\r
+ for (irslt = (char *)rslt, imem = (char *)mem; (copysize); copysize--)\r
+ *irslt++ = *imem++;\r
+ PFDI_FREE(hfdi, mem);\r
+ return rslt;\r
+}\r
+\r
+/**********************************************************************\r
+ * FDI_read_string (internal)\r
+ *\r
+ * allocate and read an arbitrarily long string from the cabinet\r
+ */\r
+char *FDI_read_string(HFDI hfdi, INT_PTR hf, long cabsize)\r
+{\r
+ size_t len=256,\r
+ oldlen = 0,\r
+ base = FDI_getoffset(hfdi, hf),\r
+ maxlen = cabsize - base;\r
+ BOOL ok = FALSE;\r
+ unsigned int i;\r
+ cab_UBYTE *buf = NULL;\r
+\r
+ TRACE("(hfdi == ^%p, hf == %d)\n", hfdi, hf);\r
+\r
+ do {\r
+ if (len > maxlen) len = maxlen;\r
+ if (!(buf = FDI_realloc(hfdi, buf, oldlen, len))) break;\r
+ oldlen = len;\r
+ if (!PFDI_READ(hfdi, hf, buf, len)) break;\r
+\r
+ /* search for a null terminator in what we've just read */\r
+ for (i=0; i < len; i++) {\r
+ if (!buf[i]) {ok=TRUE; break;}\r
+ }\r
+\r
+ if (!ok) {\r
+ if (len == maxlen) {\r
+ ERR("cabinet is truncated\n");\r
+ break;\r
+ }\r
+ len += 256;\r
+ PFDI_SEEK(hfdi, hf, base, SEEK_SET);\r
+ }\r
+ } while (!ok);\r
+\r
+ if (!ok) {\r
+ if (buf)\r
+ PFDI_FREE(hfdi, buf);\r
+ else\r
+ ERR("out of memory!\n");\r
+ return NULL;\r
+ }\r
+\r
+ /* otherwise, set the stream to just after the string and return */\r
+ PFDI_SEEK(hfdi, hf, base + ((cab_off_t) strlen((char *) buf)) + 1, SEEK_SET);\r
+\r
+ return (char *) buf;\r
+}\r
+\r
+/******************************************************************\r
+ * FDI_read_entries (internal)\r
+ *\r
+ * process the cabinet header in the style of FDIIsCabinet, but\r
+ * without the sanity checks (and bug)\r
+ */\r
+BOOL FDI_read_entries(\r
+ HFDI hfdi,\r
+ INT_PTR hf,\r
+ PFDICABINETINFO pfdici,\r
+ PMORE_ISCAB_INFO pmii)\r
+{\r
+ int num_folders, num_files, header_resv, folder_resv = 0;\r
+ LONG base_offset, cabsize;\r
+ USHORT setid, cabidx, flags;\r
+ cab_UBYTE buf[64], block_resv;\r
+ char *prevname = NULL, *previnfo = NULL, *nextname = NULL, *nextinfo = NULL;\r
+\r
+ TRACE("(hfdi == ^%p, hf == %d, pfdici == ^%p)\n", hfdi, hf, pfdici);\r
+\r
+ /* \r
+ * FIXME: I just noticed that I am memorizing the initial file pointer\r
+ * offset and restoring it before reading in the rest of the header\r
+ * information in the cabinet. Perhaps that's correct -- that is, perhaps\r
+ * this API is supposed to support "streaming" cabinets which are embedded\r
+ * in other files, or cabinets which begin at file offsets other than zero.\r
+ * Otherwise, I should instead go to the absolute beginning of the file.\r
+ * (Either way, the semantics of wine's FDICopy require me to leave the\r
+ * file pointer where it is afterwards -- If Windows does not do so, we\r
+ * ought to duplicate the native behavior in the FDIIsCabinet API, not here.\r
+ * \r
+ * So, the answer lies in Windows; will native cabinet.dll recognize a\r
+ * cabinet "file" embedded in another file? Note that cabextract.c does\r
+ * support this, which implies that Microsoft's might. I haven't tried it\r
+ * yet so I don't know. ATM, most of wine's FDI cabinet routines (except\r
+ * this one) would not work in this way. To fix it, we could just make the\r
+ * various references to absolute file positions in the code relative to an\r
+ * initial "beginning" offset. Because the FDICopy API doesn't take a\r
+ * file-handle like this one, we would therein need to search through the\r
+ * file for the beginning of the cabinet (as we also do in cabextract.c).\r
+ * Note that this limits us to a maximum of one cabinet per. file: the first.\r
+ *\r
+ * So, in summary: either the code below is wrong, or the rest of fdi.c is\r
+ * wrong... I cannot imagine that both are correct ;) One of these flaws\r
+ * should be fixed after determining the behavior on Windows. We ought\r
+ * to check both FDIIsCabinet and FDICopy for the right behavior.\r
+ *\r
+ * -gmt\r
+ */\r
+\r
+ /* get basic offset & size info */\r
+ base_offset = FDI_getoffset(hfdi, hf);\r
+\r
+ if (PFDI_SEEK(hfdi, hf, 0, SEEK_END) == -1) {\r
+ if (pmii) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_NOT_A_CABINET;\r
+ PFDI_INT(hfdi)->perf->erfType = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ }\r
+ return FALSE;\r
+ }\r
+\r
+ cabsize = FDI_getoffset(hfdi, hf);\r
+\r
+ if ((cabsize == -1) || (base_offset == -1) || \r
+ ( PFDI_SEEK(hfdi, hf, base_offset, SEEK_SET) == -1 )) {\r
+ if (pmii) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_NOT_A_CABINET;\r
+ PFDI_INT(hfdi)->perf->erfType = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ }\r
+ return FALSE;\r
+ }\r
+\r
+ /* read in the CFHEADER */\r
+ if (PFDI_READ(hfdi, hf, buf, cfhead_SIZEOF) != cfhead_SIZEOF) {\r
+ if (pmii) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_NOT_A_CABINET;\r
+ PFDI_INT(hfdi)->perf->erfType = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ }\r
+ return FALSE;\r
+ }\r
+ \r
+ /* check basic MSCF signature */\r
+ if (EndGetI32(buf+cfhead_Signature) != 0x4643534d) {\r
+ if (pmii) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_NOT_A_CABINET;\r
+ PFDI_INT(hfdi)->perf->erfType = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ }\r
+ return FALSE;\r
+ }\r
+\r
+ /* get the number of folders */\r
+ num_folders = EndGetI16(buf+cfhead_NumFolders);\r
+ if (num_folders == 0) {\r
+ /* PONDERME: is this really invalid? */\r
+ WARN("weird cabinet detect failure: no folders in cabinet\n");\r
+ if (pmii) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_NOT_A_CABINET;\r
+ PFDI_INT(hfdi)->perf->erfType = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ }\r
+ return FALSE;\r
+ }\r
+\r
+ /* get the number of files */\r
+ num_files = EndGetI16(buf+cfhead_NumFiles);\r
+ if (num_files == 0) {\r
+ /* PONDERME: is this really invalid? */\r
+ WARN("weird cabinet detect failure: no files in cabinet\n");\r
+ if (pmii) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_NOT_A_CABINET;\r
+ PFDI_INT(hfdi)->perf->erfType = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ }\r
+ return FALSE;\r
+ }\r
+\r
+ /* setid */\r
+ setid = EndGetI16(buf+cfhead_SetID);\r
+\r
+ /* cabinet (set) index */\r
+ cabidx = EndGetI16(buf+cfhead_CabinetIndex);\r
+\r
+ /* check the header revision */\r
+ if ((buf[cfhead_MajorVersion] > 1) ||\r
+ (buf[cfhead_MajorVersion] == 1 && buf[cfhead_MinorVersion] > 3))\r
+ {\r
+ WARN("cabinet format version > 1.3\n");\r
+ if (pmii) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_UNKNOWN_CABINET_VERSION;\r
+ PFDI_INT(hfdi)->perf->erfType = 0; /* ? */\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ }\r
+ return FALSE;\r
+ }\r
+\r
+ /* pull the flags out */\r
+ flags = EndGetI16(buf+cfhead_Flags);\r
+\r
+ /* read the reserved-sizes part of header, if present */\r
+ if (flags & cfheadRESERVE_PRESENT) {\r
+ if (PFDI_READ(hfdi, hf, buf, cfheadext_SIZEOF) != cfheadext_SIZEOF) {\r
+ ERR("bunk reserve-sizes?\n");\r
+ if (pmii) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_CORRUPT_CABINET;\r
+ PFDI_INT(hfdi)->perf->erfType = 0; /* ? */\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ }\r
+ return FALSE;\r
+ }\r
+\r
+ header_resv = EndGetI16(buf+cfheadext_HeaderReserved);\r
+ if (pmii) pmii->header_resv = header_resv;\r
+ folder_resv = buf[cfheadext_FolderReserved];\r
+ if (pmii) pmii->folder_resv = folder_resv;\r
+ block_resv = buf[cfheadext_DataReserved];\r
+ if (pmii) pmii->block_resv = block_resv;\r
+\r
+ if (header_resv > 60000) {\r
+ WARN("WARNING; header reserved space > 60000\n");\r
+ }\r
+\r
+ /* skip the reserved header */\r
+ if ((header_resv) && (PFDI_SEEK(hfdi, hf, header_resv, SEEK_CUR) == -1)) {\r
+ ERR("seek failure: header_resv\n");\r
+ if (pmii) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_CORRUPT_CABINET;\r
+ PFDI_INT(hfdi)->perf->erfType = 0; /* ? */\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ }\r
+ return FALSE;\r
+ }\r
+ }\r
+\r
+ if (flags & cfheadPREV_CABINET) {\r
+ prevname = FDI_read_string(hfdi, hf, cabsize);\r
+ if (!prevname) {\r
+ if (pmii) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_CORRUPT_CABINET;\r
+ PFDI_INT(hfdi)->perf->erfType = 0; /* ? */\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ }\r
+ return FALSE;\r
+ } else\r
+ if (pmii)\r
+ pmii->prevname = prevname;\r
+ else\r
+ PFDI_FREE(hfdi, prevname);\r
+ previnfo = FDI_read_string(hfdi, hf, cabsize);\r
+ if (previnfo) {\r
+ if (pmii) \r
+ pmii->previnfo = previnfo;\r
+ else\r
+ PFDI_FREE(hfdi, previnfo);\r
+ }\r
+ }\r
+\r
+ if (flags & cfheadNEXT_CABINET) {\r
+ if (pmii)\r
+ pmii->hasnext = TRUE;\r
+ nextname = FDI_read_string(hfdi, hf, cabsize);\r
+ if (!nextname) {\r
+ if ((flags & cfheadPREV_CABINET) && pmii) {\r
+ if (pmii->prevname) PFDI_FREE(hfdi, prevname);\r
+ if (pmii->previnfo) PFDI_FREE(hfdi, previnfo);\r
+ }\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_CORRUPT_CABINET;\r
+ PFDI_INT(hfdi)->perf->erfType = 0; /* ? */\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ return FALSE;\r
+ } else\r
+ if (pmii)\r
+ pmii->nextname = nextname;\r
+ else\r
+ PFDI_FREE(hfdi, nextname);\r
+ nextinfo = FDI_read_string(hfdi, hf, cabsize);\r
+ if (nextinfo) {\r
+ if (pmii)\r
+ pmii->nextinfo = nextinfo;\r
+ else\r
+ PFDI_FREE(hfdi, nextinfo);\r
+ }\r
+ }\r
+\r
+ /* we could process the whole cabinet searching for problems;\r
+ instead lets stop here. Now let's fill out the paperwork */\r
+ pfdici->cbCabinet = cabsize;\r
+ pfdici->cFolders = num_folders;\r
+ pfdici->cFiles = num_files;\r
+ pfdici->setID = setid;\r
+ pfdici->iCabinet = cabidx;\r
+ pfdici->fReserve = (flags & cfheadRESERVE_PRESENT) ? TRUE : FALSE;\r
+ pfdici->hasprev = (flags & cfheadPREV_CABINET) ? TRUE : FALSE;\r
+ pfdici->hasnext = (flags & cfheadNEXT_CABINET) ? TRUE : FALSE;\r
+ return TRUE;\r
+}\r
+\r
+/***********************************************************************\r
+ * FDIIsCabinet (CABINET.21)\r
+ *\r
+ * Informs the caller as to whether or not the provided file handle is\r
+ * really a cabinet or not, filling out the provided PFDICABINETINFO\r
+ * structure with information about the cabinet. Brief explanations of\r
+ * the elements of this structure are available as comments accompanying\r
+ * its definition in wine's include/fdi.h.\r
+ *\r
+ * PARAMS\r
+ * hfdi [I] An HFDI from FDICreate\r
+ * hf [I] The file handle about which the caller inquires\r
+ * pfdici [IO] Pointer to a PFDICABINETINFO structure which will\r
+ * be filled out with information about the cabinet\r
+ * file indicated by hf if, indeed, it is determined\r
+ * to be a cabinet.\r
+ * \r
+ * RETURNS\r
+ * TRUE if the file is a cabinet. The info pointed to by pfdici will\r
+ * be provided.\r
+ * FALSE if the file is not a cabinet, or if an error was encountered\r
+ * while processing the cabinet. The PERF structure provided to\r
+ * FDICreate can be queried for more error information.\r
+ *\r
+ * INCLUDES\r
+ * fdi.c\r
+ */\r
+BOOL __cdecl FDIIsCabinet(\r
+ HFDI hfdi,\r
+ INT_PTR hf,\r
+ PFDICABINETINFO pfdici)\r
+{\r
+ BOOL rv;\r
+\r
+ TRACE("(hfdi == ^%p, hf == ^%d, pfdici == ^%p)\n", hfdi, hf, pfdici);\r
+\r
+ if (!REALLY_IS_FDI(hfdi)) {\r
+ ERR("REALLY_IS_FDI failed on ^%p\n", hfdi);\r
+ SetLastError(ERROR_INVALID_HANDLE);\r
+ return FALSE;\r
+ }\r
+\r
+ if (!hf) {\r
+ ERR("(!hf)!\n");\r
+ /* PFDI_INT(hfdi)->perf->erfOper = FDIERROR_CABINET_NOT_FOUND;\r
+ PFDI_INT(hfdi)->perf->erfType = ERROR_INVALID_HANDLE;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE; */\r
+ SetLastError(ERROR_INVALID_HANDLE);\r
+ return FALSE;\r
+ }\r
+\r
+ if (!pfdici) {\r
+ ERR("(!pfdici)!\n");\r
+ /* PFDI_INT(hfdi)->perf->erfOper = FDIERROR_NONE;\r
+ PFDI_INT(hfdi)->perf->erfType = ERROR_BAD_ARGUMENTS;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE; */\r
+ SetLastError(ERROR_BAD_ARGUMENTS);\r
+ return FALSE;\r
+ }\r
+ rv = FDI_read_entries(hfdi, hf, pfdici, NULL); \r
+\r
+ if (rv)\r
+ pfdici->hasnext = FALSE; /* yuck. duplicate apparent cabinet.dll bug */\r
+\r
+ return rv;\r
+}\r
+\r
+/******************************************************************\r
+ * QTMfdi_initmodel (internal)\r
+ *\r
+ * Initialize a model which decodes symbols from [s] to [s]+[n]-1\r
+ */\r
+void QTMfdi_initmodel(struct QTMmodel *m, struct QTMmodelsym *sym, int n, int s) {\r
+ int i;\r
+ m->shiftsleft = 4;\r
+ m->entries = n;\r
+ m->syms = sym;\r
+ memset(m->tabloc, 0xFF, sizeof(m->tabloc)); /* clear out look-up table */\r
+ for (i = 0; i < n; i++) {\r
+ m->tabloc[i+s] = i; /* set up a look-up entry for symbol */\r
+ m->syms[i].sym = i+s; /* actual symbol */\r
+ m->syms[i].cumfreq = n-i; /* current frequency of that symbol */\r
+ }\r
+ m->syms[n].cumfreq = 0;\r
+}\r
+\r
+/******************************************************************\r
+ * QTMfdi_init (internal)\r
+ */\r
+int QTMfdi_init(int window, int level, fdi_decomp_state *decomp_state) {\r
+ unsigned int wndsize = 1 << window;\r
+ int msz = window * 2, i;\r
+ cab_ULONG j;\r
+\r
+ /* QTM supports window sizes of 2^10 (1Kb) through 2^21 (2Mb) */\r
+ /* if a previously allocated window is big enough, keep it */\r
+ if (window < 10 || window > 21) return DECR_DATAFORMAT;\r
+ if (QTM(actual_size) < wndsize) {\r
+ if (QTM(window)) PFDI_FREE(CAB(hfdi), QTM(window));\r
+ QTM(window) = NULL;\r
+ }\r
+ if (!QTM(window)) {\r
+ if (!(QTM(window) = PFDI_ALLOC(CAB(hfdi), wndsize))) return DECR_NOMEMORY;\r
+ QTM(actual_size) = wndsize;\r
+ }\r
+ QTM(window_size) = wndsize;\r
+ QTM(window_posn) = 0;\r
+\r
+ /* initialize static slot/extrabits tables */\r
+ for (i = 0, j = 0; i < 27; i++) {\r
+ CAB(q_length_extra)[i] = (i == 26) ? 0 : (i < 2 ? 0 : i - 2) >> 2;\r
+ CAB(q_length_base)[i] = j; j += 1 << ((i == 26) ? 5 : CAB(q_length_extra)[i]);\r
+ }\r
+ for (i = 0, j = 0; i < 42; i++) {\r
+ CAB(q_extra_bits)[i] = (i < 2 ? 0 : i-2) >> 1;\r
+ CAB(q_position_base)[i] = j; j += 1 << CAB(q_extra_bits)[i];\r
+ }\r
+\r
+ /* initialize arithmetic coding models */\r
+\r
+ QTMfdi_initmodel(&QTM(model7), &QTM(m7sym)[0], 7, 0);\r
+\r
+ QTMfdi_initmodel(&QTM(model00), &QTM(m00sym)[0], 0x40, 0x00);\r
+ QTMfdi_initmodel(&QTM(model40), &QTM(m40sym)[0], 0x40, 0x40);\r
+ QTMfdi_initmodel(&QTM(model80), &QTM(m80sym)[0], 0x40, 0x80);\r
+ QTMfdi_initmodel(&QTM(modelC0), &QTM(mC0sym)[0], 0x40, 0xC0);\r
+\r
+ /* model 4 depends on table size, ranges from 20 to 24 */\r
+ QTMfdi_initmodel(&QTM(model4), &QTM(m4sym)[0], (msz < 24) ? msz : 24, 0);\r
+ /* model 5 depends on table size, ranges from 20 to 36 */\r
+ QTMfdi_initmodel(&QTM(model5), &QTM(m5sym)[0], (msz < 36) ? msz : 36, 0);\r
+ /* model 6pos depends on table size, ranges from 20 to 42 */\r
+ QTMfdi_initmodel(&QTM(model6pos), &QTM(m6psym)[0], msz, 0);\r
+ QTMfdi_initmodel(&QTM(model6len), &QTM(m6lsym)[0], 27, 0);\r
+\r
+ return DECR_OK;\r
+}\r
+\r
+/************************************************************\r
+ * LZXfdi_init (internal)\r
+ */\r
+int LZXfdi_init(int window, fdi_decomp_state *decomp_state) {\r
+ cab_ULONG wndsize = 1 << window;\r
+ int i, j, posn_slots;\r
+\r
+ /* LZX supports window sizes of 2^15 (32Kb) through 2^21 (2Mb) */\r
+ /* if a previously allocated window is big enough, keep it */\r
+ if (window < 15 || window > 21) return DECR_DATAFORMAT;\r
+ if (LZX(actual_size) < wndsize) {\r
+ if (LZX(window)) PFDI_FREE(CAB(hfdi), LZX(window));\r
+ LZX(window) = NULL;\r
+ }\r
+ if (!LZX(window)) {\r
+ if (!(LZX(window) = PFDI_ALLOC(CAB(hfdi), wndsize))) return DECR_NOMEMORY;\r
+ LZX(actual_size) = wndsize;\r
+ }\r
+ LZX(window_size) = wndsize;\r
+\r
+ /* initialize static tables */\r
+ for (i=0, j=0; i <= 50; i += 2) {\r
+ CAB(extra_bits)[i] = CAB(extra_bits)[i+1] = j; /* 0,0,0,0,1,1,2,2,3,3... */\r
+ if ((i != 0) && (j < 17)) j++; /* 0,0,1,2,3,4...15,16,17,17,17,17... */\r
+ }\r
+ for (i=0, j=0; i <= 50; i++) {\r
+ CAB(lzx_position_base)[i] = j; /* 0,1,2,3,4,6,8,12,16,24,32,... */\r
+ j += 1 << CAB(extra_bits)[i]; /* 1,1,1,1,2,2,4,4,8,8,16,16,32,32,... */\r
+ }\r
+\r
+ /* calculate required position slots */\r
+ if (window == 20) posn_slots = 42;\r
+ else if (window == 21) posn_slots = 50;\r
+ else posn_slots = window << 1;\r
+\r
+ /*posn_slots=i=0; while (i < wndsize) i += 1 << CAB(extra_bits)[posn_slots++]; */\r
+\r
+ LZX(R0) = LZX(R1) = LZX(R2) = 1;\r
+ LZX(main_elements) = LZX_NUM_CHARS + (posn_slots << 3);\r
+ LZX(header_read) = 0;\r
+ LZX(frames_read) = 0;\r
+ LZX(block_remaining) = 0;\r
+ LZX(block_type) = LZX_BLOCKTYPE_INVALID;\r
+ LZX(intel_curpos) = 0;\r
+ LZX(intel_started) = 0;\r
+ LZX(window_posn) = 0;\r
+\r
+ /* initialize tables to 0 (because deltas will be applied to them) */\r
+ for (i = 0; i < LZX_MAINTREE_MAXSYMBOLS; i++) LZX(MAINTREE_len)[i] = 0;\r
+ for (i = 0; i < LZX_LENGTH_MAXSYMBOLS; i++) LZX(LENGTH_len)[i] = 0;\r
+\r
+ return DECR_OK;\r
+}\r
+\r
+/****************************************************\r
+ * NONEfdi_decomp(internal)\r
+ */\r
+int NONEfdi_decomp(int inlen, int outlen, fdi_decomp_state *decomp_state)\r
+{\r
+ if (inlen != outlen) return DECR_ILLEGALDATA;\r
+ memcpy(CAB(outbuf), CAB(inbuf), (size_t) inlen);\r
+ return DECR_OK;\r
+}\r
+\r
+/********************************************************\r
+ * Ziphuft_free (internal)\r
+ */\r
+void fdi_Ziphuft_free(HFDI hfdi, struct Ziphuft *t)\r
+{\r
+ register struct Ziphuft *p, *q;\r
+\r
+ /* Go through linked list, freeing from the allocated (t[-1]) address. */\r
+ p = t;\r
+ while (p != (struct Ziphuft *)NULL)\r
+ {\r
+ q = (--p)->v.t;\r
+ PFDI_FREE(hfdi, p);\r
+ p = q;\r
+ } \r
+}\r
+\r
+/*********************************************************\r
+ * fdi_Ziphuft_build (internal)\r
+ */\r
+cab_LONG fdi_Ziphuft_build(cab_ULONG *b, cab_ULONG n, cab_ULONG s, cab_UWORD *d, cab_UWORD *e,\r
+struct Ziphuft **t, cab_LONG *m, fdi_decomp_state *decomp_state)\r
+{\r
+ cab_ULONG a; /* counter for codes of length k */\r
+ cab_ULONG el; /* length of EOB code (value 256) */\r
+ cab_ULONG f; /* i repeats in table every f entries */\r
+ cab_LONG g; /* maximum code length */\r
+ cab_LONG h; /* table level */\r
+ register cab_ULONG i; /* counter, current code */\r
+ register cab_ULONG j; /* counter */\r
+ register cab_LONG k; /* number of bits in current code */\r
+ cab_LONG *l; /* stack of bits per table */\r
+ register cab_ULONG *p; /* pointer into ZIP(c)[],ZIP(b)[],ZIP(v)[] */\r
+ register struct Ziphuft *q; /* points to current table */\r
+ struct Ziphuft r; /* table entry for structure assignment */\r
+ register cab_LONG w; /* bits before this table == (l * h) */\r
+ cab_ULONG *xp; /* pointer into x */\r
+ cab_LONG y; /* number of dummy codes added */\r
+ cab_ULONG z; /* number of entries in current table */\r
+\r
+ l = ZIP(lx)+1;\r
+\r
+ /* Generate counts for each bit length */\r
+ el = n > 256 ? b[256] : ZIPBMAX; /* set length of EOB code, if any */\r
+\r
+ for(i = 0; i < ZIPBMAX+1; ++i)\r
+ ZIP(c)[i] = 0;\r
+ p = b; i = n;\r
+ do\r
+ {\r
+ ZIP(c)[*p]++; p++; /* assume all entries <= ZIPBMAX */\r
+ } while (--i);\r
+ if (ZIP(c)[0] == n) /* null input--all zero length codes */\r
+ {\r
+ *t = (struct Ziphuft *)NULL;\r
+ *m = 0;\r
+ return 0;\r
+ }\r
+\r
+ /* Find minimum and maximum length, bound *m by those */\r
+ for (j = 1; j <= ZIPBMAX; j++)\r
+ if (ZIP(c)[j])\r
+ break;\r
+ k = j; /* minimum code length */\r
+ if ((cab_ULONG)*m < j)\r
+ *m = j;\r
+ for (i = ZIPBMAX; i; i--)\r
+ if (ZIP(c)[i])\r
+ break;\r
+ g = i; /* maximum code length */\r
+ if ((cab_ULONG)*m > i)\r
+ *m = i;\r
+\r
+ /* Adjust last length count to fill out codes, if needed */\r
+ for (y = 1 << j; j < i; j++, y <<= 1)\r
+ if ((y -= ZIP(c)[j]) < 0)\r
+ return 2; /* bad input: more codes than bits */\r
+ if ((y -= ZIP(c)[i]) < 0)\r
+ return 2;\r
+ ZIP(c)[i] += y;\r
+\r
+ /* Generate starting offsets LONGo the value table for each length */\r
+ ZIP(x)[1] = j = 0;\r
+ p = ZIP(c) + 1; xp = ZIP(x) + 2;\r
+ while (--i)\r
+ { /* note that i == g from above */\r
+ *xp++ = (j += *p++);\r
+ }\r
+\r
+ /* Make a table of values in order of bit lengths */\r
+ p = b; i = 0;\r
+ do{\r
+ if ((j = *p++) != 0)\r
+ ZIP(v)[ZIP(x)[j]++] = i;\r
+ } while (++i < n);\r
+\r
+\r
+ /* Generate the Huffman codes and for each, make the table entries */\r
+ ZIP(x)[0] = i = 0; /* first Huffman code is zero */\r
+ p = ZIP(v); /* grab values in bit order */\r
+ h = -1; /* no tables yet--level -1 */\r
+ w = l[-1] = 0; /* no bits decoded yet */\r
+ ZIP(u)[0] = (struct Ziphuft *)NULL; /* just to keep compilers happy */\r
+ q = (struct Ziphuft *)NULL; /* ditto */\r
+ z = 0; /* ditto */\r
+\r
+ /* go through the bit lengths (k already is bits in shortest code) */\r
+ for (; k <= g; k++)\r
+ {\r
+ a = ZIP(c)[k];\r
+ while (a--)\r
+ {\r
+ /* here i is the Huffman code of length k bits for value *p */\r
+ /* make tables up to required level */\r
+ while (k > w + l[h])\r
+ {\r
+ w += l[h++]; /* add bits already decoded */\r
+\r
+ /* compute minimum size table less than or equal to *m bits */\r
+ z = (z = g - w) > (cab_ULONG)*m ? *m : z; /* upper limit */\r
+ if ((f = 1 << (j = k - w)) > a + 1) /* try a k-w bit table */\r
+ { /* too few codes for k-w bit table */\r
+ f -= a + 1; /* deduct codes from patterns left */\r
+ xp = ZIP(c) + k;\r
+ while (++j < z) /* try smaller tables up to z bits */\r
+ {\r
+ if ((f <<= 1) <= *++xp)\r
+ break; /* enough codes to use up j bits */\r
+ f -= *xp; /* else deduct codes from patterns */\r
+ }\r
+ }\r
+ if ((cab_ULONG)w + j > el && (cab_ULONG)w < el)\r
+ j = el - w; /* make EOB code end at table */\r
+ z = 1 << j; /* table entries for j-bit table */\r
+ l[h] = j; /* set table size in stack */\r
+\r
+ /* allocate and link in new table */\r
+ if (!(q = (struct Ziphuft *) PFDI_ALLOC(CAB(hfdi), (z + 1)*sizeof(struct Ziphuft))))\r
+ {\r
+ if(h)\r
+ fdi_Ziphuft_free(CAB(hfdi), ZIP(u)[0]);\r
+ return 3; /* not enough memory */\r
+ }\r
+ *t = q + 1; /* link to list for Ziphuft_free() */\r
+ *(t = &(q->v.t)) = (struct Ziphuft *)NULL;\r
+ ZIP(u)[h] = ++q; /* table starts after link */\r
+\r
+ /* connect to last table, if there is one */\r
+ if (h)\r
+ {\r
+ ZIP(x)[h] = i; /* save pattern for backing up */\r
+ r.b = (cab_UBYTE)l[h-1]; /* bits to dump before this table */\r
+ r.e = (cab_UBYTE)(16 + j); /* bits in this table */\r
+ r.v.t = q; /* pointer to this table */\r
+ j = (i & ((1 << w) - 1)) >> (w - l[h-1]);\r
+ ZIP(u)[h-1][j] = r; /* connect to last table */\r
+ }\r
+ }\r
+\r
+ /* set up table entry in r */\r
+ r.b = (cab_UBYTE)(k - w);\r
+ if (p >= ZIP(v) + n)\r
+ r.e = 99; /* out of values--invalid code */\r
+ else if (*p < s)\r
+ {\r
+ r.e = (cab_UBYTE)(*p < 256 ? 16 : 15); /* 256 is end-of-block code */\r
+ r.v.n = *p++; /* simple code is just the value */\r
+ }\r
+ else\r
+ {\r
+ r.e = (cab_UBYTE)e[*p - s]; /* non-simple--look up in lists */\r
+ r.v.n = d[*p++ - s];\r
+ }\r
+\r
+ /* fill code-like entries with r */\r
+ f = 1 << (k - w);\r
+ for (j = i >> w; j < z; j += f)\r
+ q[j] = r;\r
+\r
+ /* backwards increment the k-bit code i */\r
+ for (j = 1 << (k - 1); i & j; j >>= 1)\r
+ i ^= j;\r
+ i ^= j;\r
+\r
+ /* backup over finished tables */\r
+ while ((i & ((1 << w) - 1)) != ZIP(x)[h])\r
+ w -= l[--h]; /* don't need to update q */\r
+ }\r
+ }\r
+\r
+ /* return actual size of base table */\r
+ *m = l[0];\r
+\r
+ /* Return true (1) if we were given an incomplete table */\r
+ return y != 0 && g != 1;\r
+}\r
+\r
+/*********************************************************\r
+ * fdi_Zipinflate_codes (internal)\r
+ */\r
+cab_LONG fdi_Zipinflate_codes(struct Ziphuft *tl, struct Ziphuft *td,\r
+ cab_LONG bl, cab_LONG bd, fdi_decomp_state *decomp_state)\r
+{\r
+ register cab_ULONG e; /* table entry flag/number of extra bits */\r
+ cab_ULONG n, d; /* length and index for copy */\r
+ cab_ULONG w; /* current window position */\r
+ struct Ziphuft *t; /* pointer to table entry */\r
+ cab_ULONG ml, md; /* masks for bl and bd bits */\r
+ register cab_ULONG b; /* bit buffer */\r
+ register cab_ULONG k; /* number of bits in bit buffer */\r
+\r
+ /* make local copies of globals */\r
+ b = ZIP(bb); /* initialize bit buffer */\r
+ k = ZIP(bk);\r
+ w = ZIP(window_posn); /* initialize window position */\r
+\r
+ /* inflate the coded data */\r
+ ml = Zipmask[bl]; /* precompute masks for speed */\r
+ md = Zipmask[bd];\r
+\r
+ for(;;)\r
+ {\r
+ ZIPNEEDBITS((cab_ULONG)bl)\r
+ if((e = (t = tl + ((cab_ULONG)b & ml))->e) > 16)\r
+ do\r
+ {\r
+ if (e == 99)\r
+ return 1;\r
+ ZIPDUMPBITS(t->b)\r
+ e -= 16;\r
+ ZIPNEEDBITS(e)\r
+ } while ((e = (t = t->v.t + ((cab_ULONG)b & Zipmask[e]))->e) > 16);\r
+ ZIPDUMPBITS(t->b)\r
+ if (e == 16) /* then it's a literal */\r
+ CAB(outbuf)[w++] = (cab_UBYTE)t->v.n;\r
+ else /* it's an EOB or a length */\r
+ {\r
+ /* exit if end of block */\r
+ if(e == 15)\r
+ break;\r
+\r
+ /* get length of block to copy */\r
+ ZIPNEEDBITS(e)\r
+ n = t->v.n + ((cab_ULONG)b & Zipmask[e]);\r
+ ZIPDUMPBITS(e);\r
+\r
+ /* decode distance of block to copy */\r
+ ZIPNEEDBITS((cab_ULONG)bd)\r
+ if ((e = (t = td + ((cab_ULONG)b & md))->e) > 16)\r
+ do {\r
+ if (e == 99)\r
+ return 1;\r
+ ZIPDUMPBITS(t->b)\r
+ e -= 16;\r
+ ZIPNEEDBITS(e)\r
+ } while ((e = (t = t->v.t + ((cab_ULONG)b & Zipmask[e]))->e) > 16);\r
+ ZIPDUMPBITS(t->b)\r
+ ZIPNEEDBITS(e)\r
+ d = w - t->v.n - ((cab_ULONG)b & Zipmask[e]);\r
+ ZIPDUMPBITS(e)\r
+ do\r
+ {\r
+ n -= (e = (e = ZIPWSIZE - ((d &= ZIPWSIZE-1) > w ? d : w)) > n ?n:e);\r
+ do\r
+ {\r
+ CAB(outbuf)[w++] = CAB(outbuf)[d++];\r
+ } while (--e);\r
+ } while (n);\r
+ }\r
+ }\r
+\r
+ /* restore the globals from the locals */\r
+ ZIP(window_posn) = w; /* restore global window pointer */\r
+ ZIP(bb) = b; /* restore global bit buffer */\r
+ ZIP(bk) = k;\r
+\r
+ /* done */\r
+ return 0;\r
+}\r
+\r
+/***********************************************************\r
+ * Zipinflate_stored (internal)\r
+ */\r
+cab_LONG fdi_Zipinflate_stored(fdi_decomp_state *decomp_state)\r
+/* "decompress" an inflated type 0 (stored) block. */\r
+{\r
+ cab_ULONG n; /* number of bytes in block */\r
+ cab_ULONG w; /* current window position */\r
+ register cab_ULONG b; /* bit buffer */\r
+ register cab_ULONG k; /* number of bits in bit buffer */\r
+\r
+ /* make local copies of globals */\r
+ b = ZIP(bb); /* initialize bit buffer */\r
+ k = ZIP(bk);\r
+ w = ZIP(window_posn); /* initialize window position */\r
+\r
+ /* go to byte boundary */\r
+ n = k & 7;\r
+ ZIPDUMPBITS(n);\r
+\r
+ /* get the length and its complement */\r
+ ZIPNEEDBITS(16)\r
+ n = ((cab_ULONG)b & 0xffff);\r
+ ZIPDUMPBITS(16)\r
+ ZIPNEEDBITS(16)\r
+ if (n != (cab_ULONG)((~b) & 0xffff))\r
+ return 1; /* error in compressed data */\r
+ ZIPDUMPBITS(16)\r
+\r
+ /* read and output the compressed data */\r
+ while(n--)\r
+ {\r
+ ZIPNEEDBITS(8)\r
+ CAB(outbuf)[w++] = (cab_UBYTE)b;\r
+ ZIPDUMPBITS(8)\r
+ }\r
+\r
+ /* restore the globals from the locals */\r
+ ZIP(window_posn) = w; /* restore global window pointer */\r
+ ZIP(bb) = b; /* restore global bit buffer */\r
+ ZIP(bk) = k;\r
+ return 0;\r
+}\r
+\r
+/******************************************************\r
+ * fdi_Zipinflate_fixed (internal)\r
+ */\r
+cab_LONG fdi_Zipinflate_fixed(fdi_decomp_state *decomp_state)\r
+{\r
+ struct Ziphuft *fixed_tl;\r
+ struct Ziphuft *fixed_td;\r
+ cab_LONG fixed_bl, fixed_bd;\r
+ cab_LONG i; /* temporary variable */\r
+ cab_ULONG *l;\r
+\r
+ l = ZIP(ll);\r
+\r
+ /* literal table */\r
+ for(i = 0; i < 144; i++)\r
+ l[i] = 8;\r
+ for(; i < 256; i++)\r
+ l[i] = 9;\r
+ for(; i < 280; i++)\r
+ l[i] = 7;\r
+ for(; i < 288; i++) /* make a complete, but wrong code set */\r
+ l[i] = 8;\r
+ fixed_bl = 7;\r
+ if((i = fdi_Ziphuft_build(l, 288, 257, (cab_UWORD *) Zipcplens,\r
+ (cab_UWORD *) Zipcplext, &fixed_tl, &fixed_bl, decomp_state)))\r
+ return i;\r
+\r
+ /* distance table */\r
+ for(i = 0; i < 30; i++) /* make an incomplete code set */\r
+ l[i] = 5;\r
+ fixed_bd = 5;\r
+ if((i = fdi_Ziphuft_build(l, 30, 0, (cab_UWORD *) Zipcpdist, (cab_UWORD *) Zipcpdext,\r
+ &fixed_td, &fixed_bd, decomp_state)) > 1)\r
+ {\r
+ fdi_Ziphuft_free(CAB(hfdi), fixed_tl);\r
+ return i;\r
+ }\r
+\r
+ /* decompress until an end-of-block code */\r
+ i = fdi_Zipinflate_codes(fixed_tl, fixed_td, fixed_bl, fixed_bd, decomp_state);\r
+\r
+ fdi_Ziphuft_free(CAB(hfdi), fixed_td);\r
+ fdi_Ziphuft_free(CAB(hfdi), fixed_tl);\r
+ return i;\r
+}\r
+\r
+/**************************************************************\r
+ * fdi_Zipinflate_dynamic (internal)\r
+ */\r
+cab_LONG fdi_Zipinflate_dynamic(fdi_decomp_state *decomp_state)\r
+ /* decompress an inflated type 2 (dynamic Huffman codes) block. */\r
+{\r
+ cab_LONG i; /* temporary variables */\r
+ cab_ULONG j;\r
+ cab_ULONG *ll;\r
+ cab_ULONG l; /* last length */\r
+ cab_ULONG m; /* mask for bit lengths table */\r
+ cab_ULONG n; /* number of lengths to get */\r
+ struct Ziphuft *tl; /* literal/length code table */\r
+ struct Ziphuft *td; /* distance code table */\r
+ cab_LONG bl; /* lookup bits for tl */\r
+ cab_LONG bd; /* lookup bits for td */\r
+ cab_ULONG nb; /* number of bit length codes */\r
+ cab_ULONG nl; /* number of literal/length codes */\r
+ cab_ULONG nd; /* number of distance codes */\r
+ register cab_ULONG b; /* bit buffer */\r
+ register cab_ULONG k; /* number of bits in bit buffer */\r
+\r
+ /* make local bit buffer */\r
+ b = ZIP(bb);\r
+ k = ZIP(bk);\r
+ ll = ZIP(ll);\r
+\r
+ /* read in table lengths */\r
+ ZIPNEEDBITS(5)\r
+ nl = 257 + ((cab_ULONG)b & 0x1f); /* number of literal/length codes */\r
+ ZIPDUMPBITS(5)\r
+ ZIPNEEDBITS(5)\r
+ nd = 1 + ((cab_ULONG)b & 0x1f); /* number of distance codes */\r
+ ZIPDUMPBITS(5)\r
+ ZIPNEEDBITS(4)\r
+ nb = 4 + ((cab_ULONG)b & 0xf); /* number of bit length codes */\r
+ ZIPDUMPBITS(4)\r
+ if(nl > 288 || nd > 32)\r
+ return 1; /* bad lengths */\r
+\r
+ /* read in bit-length-code lengths */\r
+ for(j = 0; j < nb; j++)\r
+ {\r
+ ZIPNEEDBITS(3)\r
+ ll[Zipborder[j]] = (cab_ULONG)b & 7;\r
+ ZIPDUMPBITS(3)\r
+ }\r
+ for(; j < 19; j++)\r
+ ll[Zipborder[j]] = 0;\r
+\r
+ /* build decoding table for trees--single level, 7 bit lookup */\r
+ bl = 7;\r
+ if((i = fdi_Ziphuft_build(ll, 19, 19, NULL, NULL, &tl, &bl, decomp_state)) != 0)\r
+ {\r
+ if(i == 1)\r
+ fdi_Ziphuft_free(CAB(hfdi), tl);\r
+ return i; /* incomplete code set */\r
+ }\r
+\r
+ /* read in literal and distance code lengths */\r
+ n = nl + nd;\r
+ m = Zipmask[bl];\r
+ i = l = 0;\r
+ while((cab_ULONG)i < n)\r
+ {\r
+ ZIPNEEDBITS((cab_ULONG)bl)\r
+ j = (td = tl + ((cab_ULONG)b & m))->b;\r
+ ZIPDUMPBITS(j)\r
+ j = td->v.n;\r
+ if (j < 16) /* length of code in bits (0..15) */\r
+ ll[i++] = l = j; /* save last length in l */\r
+ else if (j == 16) /* repeat last length 3 to 6 times */\r
+ {\r
+ ZIPNEEDBITS(2)\r
+ j = 3 + ((cab_ULONG)b & 3);\r
+ ZIPDUMPBITS(2)\r
+ if((cab_ULONG)i + j > n)\r
+ return 1;\r
+ while (j--)\r
+ ll[i++] = l;\r
+ }\r
+ else if (j == 17) /* 3 to 10 zero length codes */\r
+ {\r
+ ZIPNEEDBITS(3)\r
+ j = 3 + ((cab_ULONG)b & 7);\r
+ ZIPDUMPBITS(3)\r
+ if ((cab_ULONG)i + j > n)\r
+ return 1;\r
+ while (j--)\r
+ ll[i++] = 0;\r
+ l = 0;\r
+ }\r
+ else /* j == 18: 11 to 138 zero length codes */\r
+ {\r
+ ZIPNEEDBITS(7)\r
+ j = 11 + ((cab_ULONG)b & 0x7f);\r
+ ZIPDUMPBITS(7)\r
+ if ((cab_ULONG)i + j > n)\r
+ return 1;\r
+ while (j--)\r
+ ll[i++] = 0;\r
+ l = 0;\r
+ }\r
+ }\r
+\r
+ /* free decoding table for trees */\r
+ fdi_Ziphuft_free(CAB(hfdi), tl);\r
+\r
+ /* restore the global bit buffer */\r
+ ZIP(bb) = b;\r
+ ZIP(bk) = k;\r
+\r
+ /* build the decoding tables for literal/length and distance codes */\r
+ bl = ZIPLBITS;\r
+ if((i = fdi_Ziphuft_build(ll, nl, 257, (cab_UWORD *) Zipcplens, (cab_UWORD *) Zipcplext,\r
+ &tl, &bl, decomp_state)) != 0)\r
+ {\r
+ if(i == 1)\r
+ fdi_Ziphuft_free(CAB(hfdi), tl);\r
+ return i; /* incomplete code set */\r
+ }\r
+ bd = ZIPDBITS;\r
+ fdi_Ziphuft_build(ll + nl, nd, 0, (cab_UWORD *) Zipcpdist, (cab_UWORD *) Zipcpdext,\r
+ &td, &bd, decomp_state);\r
+\r
+ /* decompress until an end-of-block code */\r
+ if(fdi_Zipinflate_codes(tl, td, bl, bd, decomp_state))\r
+ return 1;\r
+\r
+ /* free the decoding tables, return */\r
+ fdi_Ziphuft_free(CAB(hfdi), tl);\r
+ fdi_Ziphuft_free(CAB(hfdi), td);\r
+ return 0;\r
+}\r
+\r
+/*****************************************************\r
+ * fdi_Zipinflate_block (internal)\r
+ */\r
+cab_LONG fdi_Zipinflate_block(cab_LONG *e, fdi_decomp_state *decomp_state) /* e == last block flag */\r
+{ /* decompress an inflated block */\r
+ cab_ULONG t; /* block type */\r
+ register cab_ULONG b; /* bit buffer */\r
+ register cab_ULONG k; /* number of bits in bit buffer */\r
+\r
+ /* make local bit buffer */\r
+ b = ZIP(bb);\r
+ k = ZIP(bk);\r
+\r
+ /* read in last block bit */\r
+ ZIPNEEDBITS(1)\r
+ *e = (cab_LONG)b & 1;\r
+ ZIPDUMPBITS(1)\r
+\r
+ /* read in block type */\r
+ ZIPNEEDBITS(2)\r
+ t = (cab_ULONG)b & 3;\r
+ ZIPDUMPBITS(2)\r
+\r
+ /* restore the global bit buffer */\r
+ ZIP(bb) = b;\r
+ ZIP(bk) = k;\r
+\r
+ /* inflate that block type */\r
+ if(t == 2)\r
+ return fdi_Zipinflate_dynamic(decomp_state);\r
+ if(t == 0)\r
+ return fdi_Zipinflate_stored(decomp_state);\r
+ if(t == 1)\r
+ return fdi_Zipinflate_fixed(decomp_state);\r
+ /* bad block type */\r
+ return 2;\r
+}\r
+\r
+/****************************************************\r
+ * ZIPfdi_decomp(internal)\r
+ */\r
+int ZIPfdi_decomp(int inlen, int outlen, fdi_decomp_state *decomp_state)\r
+{\r
+ cab_LONG e; /* last block flag */\r
+\r
+ TRACE("(inlen == %d, outlen == %d)\n", inlen, outlen);\r
+\r
+ ZIP(inpos) = CAB(inbuf);\r
+ ZIP(bb) = ZIP(bk) = ZIP(window_posn) = 0;\r
+ if(outlen > ZIPWSIZE)\r
+ return DECR_DATAFORMAT;\r
+\r
+ /* CK = Chris Kirmse, official Microsoft purloiner */\r
+ if(ZIP(inpos)[0] != 0x43 || ZIP(inpos)[1] != 0x4B)\r
+ return DECR_ILLEGALDATA;\r
+ ZIP(inpos) += 2;\r
+\r
+ do {\r
+ if(fdi_Zipinflate_block(&e, decomp_state))\r
+ return DECR_ILLEGALDATA;\r
+ } while(!e);\r
+\r
+ /* return success */\r
+ return DECR_OK;\r
+}\r
+\r
+/*******************************************************************\r
+ * QTMfdi_decomp(internal)\r
+ */\r
+int QTMfdi_decomp(int inlen, int outlen, fdi_decomp_state *decomp_state)\r
+{\r
+ cab_UBYTE *inpos = CAB(inbuf);\r
+ cab_UBYTE *window = QTM(window);\r
+ cab_UBYTE *runsrc, *rundest;\r
+\r
+ cab_ULONG window_posn = QTM(window_posn);\r
+ cab_ULONG window_size = QTM(window_size);\r
+\r
+ /* used by bitstream macros */\r
+ register int bitsleft, bitrun, bitsneed;\r
+ register cab_ULONG bitbuf;\r
+\r
+ /* used by GET_SYMBOL */\r
+ cab_ULONG range;\r
+ cab_UWORD symf;\r
+ int i;\r
+\r
+ int extra, togo = outlen, match_length = 0, copy_length;\r
+ cab_UBYTE selector, sym;\r
+ cab_ULONG match_offset = 0;\r
+\r
+ cab_UWORD H = 0xFFFF, L = 0, C;\r
+\r
+ TRACE("(inlen == %d, outlen == %d)\n", inlen, outlen);\r
+\r
+ /* read initial value of C */\r
+ Q_INIT_BITSTREAM;\r
+ Q_READ_BITS(C, 16);\r
+\r
+ /* apply 2^x-1 mask */\r
+ window_posn &= window_size - 1;\r
+ /* runs can't straddle the window wraparound */\r
+ if ((window_posn + togo) > window_size) {\r
+ TRACE("straddled run\n");\r
+ return DECR_DATAFORMAT;\r
+ }\r
+\r
+ while (togo > 0) {\r
+ GET_SYMBOL(model7, selector);\r
+ switch (selector) {\r
+ case 0:\r
+ GET_SYMBOL(model00, sym); window[window_posn++] = sym; togo--;\r
+ break;\r
+ case 1:\r
+ GET_SYMBOL(model40, sym); window[window_posn++] = sym; togo--;\r
+ break;\r
+ case 2:\r
+ GET_SYMBOL(model80, sym); window[window_posn++] = sym; togo--;\r
+ break;\r
+ case 3:\r
+ GET_SYMBOL(modelC0, sym); window[window_posn++] = sym; togo--;\r
+ break;\r
+\r
+ case 4:\r
+ /* selector 4 = fixed length of 3 */\r
+ GET_SYMBOL(model4, sym);\r
+ Q_READ_BITS(extra, CAB(q_extra_bits)[sym]);\r
+ match_offset = CAB(q_position_base)[sym] + extra + 1;\r
+ match_length = 3;\r
+ break;\r
+\r
+ case 5:\r
+ /* selector 5 = fixed length of 4 */\r
+ GET_SYMBOL(model5, sym);\r
+ Q_READ_BITS(extra, CAB(q_extra_bits)[sym]);\r
+ match_offset = CAB(q_position_base)[sym] + extra + 1;\r
+ match_length = 4;\r
+ break;\r
+\r
+ case 6:\r
+ /* selector 6 = variable length */\r
+ GET_SYMBOL(model6len, sym);\r
+ Q_READ_BITS(extra, CAB(q_length_extra)[sym]);\r
+ match_length = CAB(q_length_base)[sym] + extra + 5;\r
+ GET_SYMBOL(model6pos, sym);\r
+ Q_READ_BITS(extra, CAB(q_extra_bits)[sym]);\r
+ match_offset = CAB(q_position_base)[sym] + extra + 1;\r
+ break;\r
+\r
+ default:\r
+ TRACE("Selector is bogus\n");\r
+ return DECR_ILLEGALDATA;\r
+ }\r
+\r
+ /* if this is a match */\r
+ if (selector >= 4) {\r
+ rundest = window + window_posn;\r
+ togo -= match_length;\r
+\r
+ /* copy any wrapped around source data */\r
+ if (window_posn >= match_offset) {\r
+ /* no wrap */\r
+ runsrc = rundest - match_offset;\r
+ } else {\r
+ runsrc = rundest + (window_size - match_offset);\r
+ copy_length = match_offset - window_posn;\r
+ if (copy_length < match_length) {\r
+ match_length -= copy_length;\r
+ window_posn += copy_length;\r
+ while (copy_length-- > 0) *rundest++ = *runsrc++;\r
+ runsrc = window;\r
+ }\r
+ }\r
+ window_posn += match_length;\r
+\r
+ /* copy match data - no worries about destination wraps */\r
+ while (match_length-- > 0) *rundest++ = *runsrc++;\r
+ }\r
+ } /* while (togo > 0) */\r
+\r
+ if (togo != 0) {\r
+ TRACE("Frame overflow, this_run = %d\n", togo);\r
+ return DECR_ILLEGALDATA;\r
+ }\r
+\r
+ memcpy(CAB(outbuf), window + ((!window_posn) ? window_size : window_posn) -\r
+ outlen, outlen);\r
+\r
+ QTM(window_posn) = window_posn;\r
+ return DECR_OK;\r
+}\r
+\r
+/************************************************************\r
+ * fdi_lzx_read_lens (internal)\r
+ */\r
+int fdi_lzx_read_lens(cab_UBYTE *lens, cab_ULONG first, cab_ULONG last, struct lzx_bits *lb,\r
+ fdi_decomp_state *decomp_state) {\r
+ cab_ULONG i,j, x,y;\r
+ int z;\r
+\r
+ register cab_ULONG bitbuf = lb->bb;\r
+ register int bitsleft = lb->bl;\r
+ cab_UBYTE *inpos = lb->ip;\r
+ cab_UWORD *hufftbl;\r
+ \r
+ for (x = 0; x < 20; x++) {\r
+ READ_BITS(y, 4);\r
+ LENTABLE(PRETREE)[x] = y;\r
+ }\r
+ BUILD_TABLE(PRETREE);\r
+\r
+ for (x = first; x < last; ) {\r
+ READ_HUFFSYM(PRETREE, z);\r
+ if (z == 17) {\r
+ READ_BITS(y, 4); y += 4;\r
+ while (y--) lens[x++] = 0;\r
+ }\r
+ else if (z == 18) {\r
+ READ_BITS(y, 5); y += 20;\r
+ while (y--) lens[x++] = 0;\r
+ }\r
+ else if (z == 19) {\r
+ READ_BITS(y, 1); y += 4;\r
+ READ_HUFFSYM(PRETREE, z);\r
+ z = lens[x] - z; if (z < 0) z += 17;\r
+ while (y--) lens[x++] = z;\r
+ }\r
+ else {\r
+ z = lens[x] - z; if (z < 0) z += 17;\r
+ lens[x++] = z;\r
+ }\r
+ }\r
+\r
+ lb->bb = bitbuf;\r
+ lb->bl = bitsleft;\r
+ lb->ip = inpos;\r
+ return 0;\r
+}\r
+\r
+/*******************************************************\r
+ * LZXfdi_decomp(internal)\r
+ */\r
+int LZXfdi_decomp(int inlen, int outlen, fdi_decomp_state *decomp_state) {\r
+ cab_UBYTE *inpos = CAB(inbuf);\r
+ cab_UBYTE *endinp = inpos + inlen;\r
+ cab_UBYTE *window = LZX(window);\r
+ cab_UBYTE *runsrc, *rundest;\r
+ cab_UWORD *hufftbl; /* used in READ_HUFFSYM macro as chosen decoding table */\r
+\r
+ cab_ULONG window_posn = LZX(window_posn);\r
+ cab_ULONG window_size = LZX(window_size);\r
+ cab_ULONG R0 = LZX(R0);\r
+ cab_ULONG R1 = LZX(R1);\r
+ cab_ULONG R2 = LZX(R2);\r
+\r
+ register cab_ULONG bitbuf;\r
+ register int bitsleft;\r
+ cab_ULONG match_offset, i,j,k; /* ijk used in READ_HUFFSYM macro */\r
+ struct lzx_bits lb; /* used in READ_LENGTHS macro */\r
+\r
+ int togo = outlen, this_run, main_element, aligned_bits;\r
+ int match_length, copy_length, length_footer, extra, verbatim_bits;\r
+\r
+ TRACE("(inlen == %d, outlen == %d)\n", inlen, outlen);\r
+\r
+ INIT_BITSTREAM;\r
+\r
+ /* read header if necessary */\r
+ if (!LZX(header_read)) {\r
+ i = j = 0;\r
+ READ_BITS(k, 1); if (k) { READ_BITS(i,16); READ_BITS(j,16); }\r
+ LZX(intel_filesize) = (i << 16) | j; /* or 0 if not encoded */\r
+ LZX(header_read) = 1;\r
+ }\r
+\r
+ /* main decoding loop */\r
+ while (togo > 0) {\r
+ /* last block finished, new block expected */\r
+ if (LZX(block_remaining) == 0) {\r
+ if (LZX(block_type) == LZX_BLOCKTYPE_UNCOMPRESSED) {\r
+ if (LZX(block_length) & 1) inpos++; /* realign bitstream to word */\r
+ INIT_BITSTREAM;\r
+ }\r
+\r
+ READ_BITS(LZX(block_type), 3);\r
+ READ_BITS(i, 16);\r
+ READ_BITS(j, 8);\r
+ LZX(block_remaining) = LZX(block_length) = (i << 8) | j;\r
+\r
+ switch (LZX(block_type)) {\r
+ case LZX_BLOCKTYPE_ALIGNED:\r
+ for (i = 0; i < 8; i++) { READ_BITS(j, 3); LENTABLE(ALIGNED)[i] = j; }\r
+ BUILD_TABLE(ALIGNED);\r
+ /* rest of aligned header is same as verbatim */\r
+\r
+ case LZX_BLOCKTYPE_VERBATIM:\r
+ READ_LENGTHS(MAINTREE, 0, 256, fdi_lzx_read_lens);\r
+ READ_LENGTHS(MAINTREE, 256, LZX(main_elements), fdi_lzx_read_lens);\r
+ BUILD_TABLE(MAINTREE);\r
+ if (LENTABLE(MAINTREE)[0xE8] != 0) LZX(intel_started) = 1;\r
+\r
+ READ_LENGTHS(LENGTH, 0, LZX_NUM_SECONDARY_LENGTHS, fdi_lzx_read_lens);\r
+ BUILD_TABLE(LENGTH);\r
+ break;\r
+\r
+ case LZX_BLOCKTYPE_UNCOMPRESSED:\r
+ LZX(intel_started) = 1; /* because we can't assume otherwise */\r
+ ENSURE_BITS(16); /* get up to 16 pad bits into the buffer */\r
+ if (bitsleft > 16) inpos -= 2; /* and align the bitstream! */\r
+ R0 = inpos[0]|(inpos[1]<<8)|(inpos[2]<<16)|(inpos[3]<<24);inpos+=4;\r
+ R1 = inpos[0]|(inpos[1]<<8)|(inpos[2]<<16)|(inpos[3]<<24);inpos+=4;\r
+ R2 = inpos[0]|(inpos[1]<<8)|(inpos[2]<<16)|(inpos[3]<<24);inpos+=4;\r
+ break;\r
+\r
+ default:\r
+ return DECR_ILLEGALDATA;\r
+ }\r
+ }\r
+\r
+ /* buffer exhaustion check */\r
+ if (inpos > endinp) {\r
+ /* it's possible to have a file where the next run is less than\r
+ * 16 bits in size. In this case, the READ_HUFFSYM() macro used\r
+ * in building the tables will exhaust the buffer, so we should\r
+ * allow for this, but not allow those accidentally read bits to\r
+ * be used (so we check that there are at least 16 bits\r
+ * remaining - in this boundary case they aren't really part of\r
+ * the compressed data)\r
+ */\r
+ if (inpos > (endinp+2) || bitsleft < 16) return DECR_ILLEGALDATA;\r
+ }\r
+\r
+ while ((this_run = LZX(block_remaining)) > 0 && togo > 0) {\r
+ if (this_run > togo) this_run = togo;\r
+ togo -= this_run;\r
+ LZX(block_remaining) -= this_run;\r
+\r
+ /* apply 2^x-1 mask */\r
+ window_posn &= window_size - 1;\r
+ /* runs can't straddle the window wraparound */\r
+ if ((window_posn + this_run) > window_size)\r
+ return DECR_DATAFORMAT;\r
+\r
+ switch (LZX(block_type)) {\r
+\r
+ case LZX_BLOCKTYPE_VERBATIM:\r
+ while (this_run > 0) {\r
+ READ_HUFFSYM(MAINTREE, main_element);\r
+\r
+ if (main_element < LZX_NUM_CHARS) {\r
+ /* literal: 0 to LZX_NUM_CHARS-1 */\r
+ window[window_posn++] = main_element;\r
+ this_run--;\r
+ }\r
+ else {\r
+ /* match: LZX_NUM_CHARS + ((slot<<3) | length_header (3 bits)) */\r
+ main_element -= LZX_NUM_CHARS;\r
+ \r
+ match_length = main_element & LZX_NUM_PRIMARY_LENGTHS;\r
+ if (match_length == LZX_NUM_PRIMARY_LENGTHS) {\r
+ READ_HUFFSYM(LENGTH, length_footer);\r
+ match_length += length_footer;\r
+ }\r
+ match_length += LZX_MIN_MATCH;\r
+ \r
+ match_offset = main_element >> 3;\r
+ \r
+ if (match_offset > 2) {\r
+ /* not repeated offset */\r
+ if (match_offset != 3) {\r
+ extra = CAB(extra_bits)[match_offset];\r
+ READ_BITS(verbatim_bits, extra);\r
+ match_offset = CAB(lzx_position_base)[match_offset] \r
+ - 2 + verbatim_bits;\r
+ }\r
+ else {\r
+ match_offset = 1;\r
+ }\r
+ \r
+ /* update repeated offset LRU queue */\r
+ R2 = R1; R1 = R0; R0 = match_offset;\r
+ }\r
+ else if (match_offset == 0) {\r
+ match_offset = R0;\r
+ }\r
+ else if (match_offset == 1) {\r
+ match_offset = R1;\r
+ R1 = R0; R0 = match_offset;\r
+ }\r
+ else /* match_offset == 2 */ {\r
+ match_offset = R2;\r
+ R2 = R0; R0 = match_offset;\r
+ }\r
+\r
+ rundest = window + window_posn;\r
+ this_run -= match_length;\r
+\r
+ /* copy any wrapped around source data */\r
+ if (window_posn >= match_offset) {\r
+ /* no wrap */\r
+ runsrc = rundest - match_offset;\r
+ } else {\r
+ runsrc = rundest + (window_size - match_offset);\r
+ copy_length = match_offset - window_posn;\r
+ if (copy_length < match_length) {\r
+ match_length -= copy_length;\r
+ window_posn += copy_length;\r
+ while (copy_length-- > 0) *rundest++ = *runsrc++;\r
+ runsrc = window;\r
+ }\r
+ }\r
+ window_posn += match_length;\r
+\r
+ /* copy match data - no worries about destination wraps */\r
+ while (match_length-- > 0) *rundest++ = *runsrc++;\r
+ }\r
+ }\r
+ break;\r
+\r
+ case LZX_BLOCKTYPE_ALIGNED:\r
+ while (this_run > 0) {\r
+ READ_HUFFSYM(MAINTREE, main_element);\r
+ \r
+ if (main_element < LZX_NUM_CHARS) {\r
+ /* literal: 0 to LZX_NUM_CHARS-1 */\r
+ window[window_posn++] = main_element;\r
+ this_run--;\r
+ }\r
+ else {\r
+ /* match: LZX_NUM_CHARS + ((slot<<3) | length_header (3 bits)) */\r
+ main_element -= LZX_NUM_CHARS;\r
+ \r
+ match_length = main_element & LZX_NUM_PRIMARY_LENGTHS;\r
+ if (match_length == LZX_NUM_PRIMARY_LENGTHS) {\r
+ READ_HUFFSYM(LENGTH, length_footer);\r
+ match_length += length_footer;\r
+ }\r
+ match_length += LZX_MIN_MATCH;\r
+ \r
+ match_offset = main_element >> 3;\r
+ \r
+ if (match_offset > 2) {\r
+ /* not repeated offset */\r
+ extra = CAB(extra_bits)[match_offset];\r
+ match_offset = CAB(lzx_position_base)[match_offset] - 2;\r
+ if (extra > 3) {\r
+ /* verbatim and aligned bits */\r
+ extra -= 3;\r
+ READ_BITS(verbatim_bits, extra);\r
+ match_offset += (verbatim_bits << 3);\r
+ READ_HUFFSYM(ALIGNED, aligned_bits);\r
+ match_offset += aligned_bits;\r
+ }\r
+ else if (extra == 3) {\r
+ /* aligned bits only */\r
+ READ_HUFFSYM(ALIGNED, aligned_bits);\r
+ match_offset += aligned_bits;\r
+ }\r
+ else if (extra > 0) { /* extra==1, extra==2 */\r
+ /* verbatim bits only */\r
+ READ_BITS(verbatim_bits, extra);\r
+ match_offset += verbatim_bits;\r
+ }\r
+ else /* extra == 0 */ {\r
+ /* ??? */\r
+ match_offset = 1;\r
+ }\r
+ \r
+ /* update repeated offset LRU queue */\r
+ R2 = R1; R1 = R0; R0 = match_offset;\r
+ }\r
+ else if (match_offset == 0) {\r
+ match_offset = R0;\r
+ }\r
+ else if (match_offset == 1) {\r
+ match_offset = R1;\r
+ R1 = R0; R0 = match_offset;\r
+ }\r
+ else /* match_offset == 2 */ {\r
+ match_offset = R2;\r
+ R2 = R0; R0 = match_offset;\r
+ }\r
+\r
+ rundest = window + window_posn;\r
+ this_run -= match_length;\r
+\r
+ /* copy any wrapped around source data */\r
+ if (window_posn >= match_offset) {\r
+ /* no wrap */\r
+ runsrc = rundest - match_offset;\r
+ } else {\r
+ runsrc = rundest + (window_size - match_offset);\r
+ copy_length = match_offset - window_posn;\r
+ if (copy_length < match_length) {\r
+ match_length -= copy_length;\r
+ window_posn += copy_length;\r
+ while (copy_length-- > 0) *rundest++ = *runsrc++;\r
+ runsrc = window;\r
+ }\r
+ }\r
+ window_posn += match_length;\r
+\r
+ /* copy match data - no worries about destination wraps */\r
+ while (match_length-- > 0) *rundest++ = *runsrc++;\r
+ }\r
+ }\r
+ break;\r
+\r
+ case LZX_BLOCKTYPE_UNCOMPRESSED:\r
+ if ((inpos + this_run) > endinp) return DECR_ILLEGALDATA;\r
+ memcpy(window + window_posn, inpos, (size_t) this_run);\r
+ inpos += this_run; window_posn += this_run;\r
+ break;\r
+\r
+ default:\r
+ return DECR_ILLEGALDATA; /* might as well */\r
+ }\r
+\r
+ }\r
+ }\r
+\r
+ if (togo != 0) return DECR_ILLEGALDATA;\r
+ memcpy(CAB(outbuf), window + ((!window_posn) ? window_size : window_posn) -\r
+ outlen, (size_t) outlen);\r
+\r
+ LZX(window_posn) = window_posn;\r
+ LZX(R0) = R0;\r
+ LZX(R1) = R1;\r
+ LZX(R2) = R2;\r
+\r
+ /* intel E8 decoding */\r
+ if ((LZX(frames_read)++ < 32768) && LZX(intel_filesize) != 0) {\r
+ if (outlen <= 6 || !LZX(intel_started)) {\r
+ LZX(intel_curpos) += outlen;\r
+ }\r
+ else {\r
+ cab_UBYTE *data = CAB(outbuf);\r
+ cab_UBYTE *dataend = data + outlen - 10;\r
+ cab_LONG curpos = LZX(intel_curpos);\r
+ cab_LONG filesize = LZX(intel_filesize);\r
+ cab_LONG abs_off, rel_off;\r
+\r
+ LZX(intel_curpos) = curpos + outlen;\r
+\r
+ while (data < dataend) {\r
+ if (*data++ != 0xE8) { curpos++; continue; }\r
+ abs_off = data[0] | (data[1]<<8) | (data[2]<<16) | (data[3]<<24);\r
+ if ((abs_off >= -curpos) && (abs_off < filesize)) {\r
+ rel_off = (abs_off >= 0) ? abs_off - curpos : abs_off + filesize;\r
+ data[0] = (cab_UBYTE) rel_off;\r
+ data[1] = (cab_UBYTE) (rel_off >> 8);\r
+ data[2] = (cab_UBYTE) (rel_off >> 16);\r
+ data[3] = (cab_UBYTE) (rel_off >> 24);\r
+ }\r
+ data += 4;\r
+ curpos += 5;\r
+ }\r
+ }\r
+ }\r
+ return DECR_OK;\r
+}\r
+\r
+/**********************************************************\r
+ * fdi_decomp (internal)\r
+ *\r
+ * Decompress the requested number of bytes. If savemode is zero,\r
+ * do not save the output anywhere, just plow through blocks until we\r
+ * reach the specified (uncompressed) distance from the starting point,\r
+ * and remember the position of the cabfile pointer (and which cabfile)\r
+ * after we are done; otherwise, save the data out to CAB(filehf),\r
+ * decompressing the requested number of bytes and writing them out. This\r
+ * is also where we jump to additional cabinets in the case of split\r
+ * cab's, and provide (some of) the NEXT_CABINET notification semantics.\r
+ */\r
+int fdi_decomp(struct fdi_file *fi, int savemode, fdi_decomp_state *decomp_state,\r
+ char *pszCabPath, PFNFDINOTIFY pfnfdin, void *pvUser)\r
+{\r
+ cab_ULONG bytes = savemode ? fi->length : fi->offset - CAB(offset);\r
+ cab_UBYTE buf[cfdata_SIZEOF], *data;\r
+ cab_UWORD inlen, len, outlen, cando;\r
+ cab_ULONG cksum;\r
+ cab_LONG err;\r
+ fdi_decomp_state *cab = (savemode && CAB(decomp_cab)) ? CAB(decomp_cab) : decomp_state;\r
+\r
+ TRACE("(fi == ^%p, savemode == %d, bytes == %d)\n", fi, savemode, bytes);\r
+\r
+ while (bytes > 0) {\r
+ /* cando = the max number of bytes we can do */\r
+ cando = CAB(outlen);\r
+ if (cando > bytes) cando = bytes;\r
+\r
+ /* if cando != 0 */\r
+ if (cando && savemode)\r
+ PFDI_WRITE(CAB(hfdi), CAB(filehf), CAB(outpos), cando);\r
+\r
+ CAB(outpos) += cando;\r
+ CAB(outlen) -= cando;\r
+ bytes -= cando; if (!bytes) break;\r
+\r
+ /* we only get here if we emptied the output buffer */\r
+\r
+ /* read data header + data */\r
+ inlen = outlen = 0;\r
+ while (outlen == 0) {\r
+ /* read the block header, skip the reserved part */\r
+ if (PFDI_READ(CAB(hfdi), cab->cabhf, buf, cfdata_SIZEOF) != cfdata_SIZEOF)\r
+ return DECR_INPUT;\r
+\r
+ if (PFDI_SEEK(CAB(hfdi), cab->cabhf, cab->mii.block_resv, SEEK_CUR) == -1)\r
+ return DECR_INPUT;\r
+\r
+ /* we shouldn't get blocks over CAB_INPUTMAX in size */\r
+ data = CAB(inbuf) + inlen;\r
+ len = EndGetI16(buf+cfdata_CompressedSize);\r
+ inlen += len;\r
+ if (inlen > CAB_INPUTMAX) return DECR_INPUT;\r
+ if (PFDI_READ(CAB(hfdi), cab->cabhf, data, len) != len)\r
+ return DECR_INPUT;\r
+\r
+ /* clear two bytes after read-in data */\r
+ data[len+1] = data[len+2] = 0;\r
+\r
+ /* perform checksum test on the block (if one is stored) */\r
+ cksum = EndGetI32(buf+cfdata_CheckSum);\r
+ if (cksum && cksum != checksum(buf+4, 4, checksum(data, len, 0)))\r
+ return DECR_CHECKSUM; /* checksum is wrong */\r
+\r
+ outlen = EndGetI16(buf+cfdata_UncompressedSize);\r
+\r
+ /* outlen=0 means this block was the last contiguous part\r
+ of a split block, continued in the next cabinet */\r
+ if (outlen == 0) {\r
+ int pathlen, filenamelen, idx, i, cabhf;\r
+ char fullpath[MAX_PATH], userpath[256];\r
+ FDINOTIFICATION fdin;\r
+ FDICABINETINFO fdici;\r
+ char emptystring = '\0';\r
+ cab_UBYTE buf2[64];\r
+ int success = FALSE;\r
+ struct fdi_folder *fol = NULL, *linkfol = NULL; \r
+ struct fdi_file *file = NULL, *linkfile = NULL;\r
+\r
+ tryanothercab:\r
+\r
+ /* set up the next decomp_state... */\r
+ if (!(cab->next)) {\r
+ if (!cab->mii.hasnext) return DECR_INPUT;\r
+\r
+ if (!((cab->next = PFDI_ALLOC(CAB(hfdi), sizeof(fdi_decomp_state)))))\r
+ return DECR_NOMEMORY;\r
+ \r
+ ZeroMemory(cab->next, sizeof(fdi_decomp_state));\r
+\r
+ /* copy pszCabPath to userpath */\r
+ ZeroMemory(userpath, 256);\r
+ pathlen = (pszCabPath) ? strlen(pszCabPath) : 0;\r
+ if (pathlen) {\r
+ if (pathlen < 256) {\r
+ for (i = 0; i <= pathlen; i++)\r
+ userpath[i] = pszCabPath[i];\r
+ } /* else we are in a weird place... let's leave it blank and see if the user fixes it */\r
+ } \r
+\r
+ /* initial fdintNEXT_CABINET notification */\r
+ ZeroMemory(&fdin, sizeof(FDINOTIFICATION));\r
+ fdin.psz1 = (cab->mii.nextname) ? cab->mii.nextname : &emptystring;\r
+ fdin.psz2 = (cab->mii.nextinfo) ? cab->mii.nextinfo : &emptystring;\r
+ fdin.psz3 = &userpath[0];\r
+ fdin.fdie = FDIERROR_NONE;\r
+ fdin.pv = pvUser;\r
+\r
+ if (((*pfnfdin)(fdintNEXT_CABINET, &fdin))) return DECR_USERABORT;\r
+\r
+ do {\r
+\r
+ pathlen = (userpath) ? strlen(userpath) : 0;\r
+ filenamelen = (cab->mii.nextname) ? strlen(cab->mii.nextname) : 0;\r
+\r
+ /* slight overestimation here to save CPU cycles in the developer's brain */\r
+ if ((pathlen + filenamelen + 3) > MAX_PATH) {\r
+ ERR("MAX_PATH exceeded.\n");\r
+ return DECR_ILLEGALDATA;\r
+ }\r
+\r
+ /* paste the path and filename together */\r
+ idx = 0;\r
+ if (pathlen) {\r
+ for (i = 0; i < pathlen; i++) fullpath[idx++] = userpath[i];\r
+ if (fullpath[idx - 1] != '\\') fullpath[idx++] = '\\';\r
+ }\r
+ if (filenamelen) for (i = 0; i < filenamelen; i++) fullpath[idx++] = cab->mii.nextname[i];\r
+ fullpath[idx] = '\0';\r
+ \r
+ TRACE("full cab path/file name: %s\n", debugstr_a(fullpath));\r
+ \r
+ /* try to get a handle to the cabfile */\r
+ cabhf = PFDI_OPEN(CAB(hfdi), fullpath, 32768, _S_IREAD | _S_IWRITE);\r
+ if (cabhf == -1) {\r
+ /* no file. allow the user to try again */\r
+ fdin.fdie = FDIERROR_CABINET_NOT_FOUND;\r
+ if (((*pfnfdin)(fdintNEXT_CABINET, &fdin))) return DECR_USERABORT;\r
+ continue;\r
+ }\r
+ \r
+ if (cabhf == 0) {\r
+ ERR("PFDI_OPEN returned zero for %s.\n", fullpath);\r
+ fdin.fdie = FDIERROR_CABINET_NOT_FOUND;\r
+ if (((*pfnfdin)(fdintNEXT_CABINET, &fdin))) return DECR_USERABORT;\r
+ continue;\r
+ }\r
+ \r
+ /* check if it's really a cabfile. Note that this doesn't implement the bug */\r
+ if (!FDI_read_entries(CAB(hfdi), cabhf, &fdici, &(cab->next->mii))) {\r
+ WARN("FDIIsCabinet failed.\n");\r
+ PFDI_CLOSE(CAB(hfdi), cabhf);\r
+ fdin.fdie = FDIERROR_NOT_A_CABINET;\r
+ if (((*pfnfdin)(fdintNEXT_CABINET, &fdin))) return DECR_USERABORT;\r
+ continue;\r
+ }\r
+\r
+ if ((fdici.setID != cab->setID) || (fdici.iCabinet != (cab->iCabinet + 1))) {\r
+ WARN("Wrong Cabinet.\n");\r
+ PFDI_CLOSE(CAB(hfdi), cabhf);\r
+ fdin.fdie = FDIERROR_WRONG_CABINET;\r
+ if (((*pfnfdin)(fdintNEXT_CABINET, &fdin))) return DECR_USERABORT;\r
+ continue;\r
+ }\r
+ \r
+ break;\r
+\r
+ } while (1);\r
+ \r
+ /* cabinet notification */\r
+ ZeroMemory(&fdin, sizeof(FDINOTIFICATION));\r
+ fdin.setID = fdici.setID;\r
+ fdin.iCabinet = fdici.iCabinet;\r
+ fdin.pv = pvUser;\r
+ fdin.psz1 = (cab->next->mii.nextname) ? cab->next->mii.nextname : &emptystring;\r
+ fdin.psz2 = (cab->next->mii.nextinfo) ? cab->next->mii.nextinfo : &emptystring;\r
+ fdin.psz3 = pszCabPath;\r
+ \r
+ if (((*pfnfdin)(fdintCABINET_INFO, &fdin))) return DECR_USERABORT;\r
+ \r
+ cab->next->setID = fdici.setID;\r
+ cab->next->iCabinet = fdici.iCabinet;\r
+ cab->next->hfdi = CAB(hfdi);\r
+ cab->next->filehf = CAB(filehf);\r
+ cab->next->cabhf = cabhf;\r
+ cab->next->decompress = CAB(decompress); /* crude, but unused anyhow */\r
+\r
+ cab = cab->next; /* advance to the next cabinet */\r
+\r
+ /* read folders */\r
+ for (i = 0; i < fdici.cFolders; i++) {\r
+ if (PFDI_READ(CAB(hfdi), cab->cabhf, buf2, cffold_SIZEOF) != cffold_SIZEOF) \r
+ return DECR_INPUT;\r
+\r
+ if (cab->mii.folder_resv > 0)\r
+ PFDI_SEEK(CAB(hfdi), cab->cabhf, cab->mii.folder_resv, SEEK_CUR);\r
+ \r
+ fol = (struct fdi_folder *) PFDI_ALLOC(CAB(hfdi), sizeof(struct fdi_folder));\r
+ if (!fol) {\r
+ ERR("out of memory!\n");\r
+ return DECR_NOMEMORY;\r
+ }\r
+ ZeroMemory(fol, sizeof(struct fdi_folder));\r
+ if (!(cab->firstfol)) cab->firstfol = fol;\r
+ \r
+ fol->offset = (cab_off_t) EndGetI32(buf2+cffold_DataOffset);\r
+ fol->num_blocks = EndGetI16(buf2+cffold_NumBlocks);\r
+ fol->comp_type = EndGetI16(buf2+cffold_CompType);\r
+ \r
+ if (linkfol)\r
+ linkfol->next = fol; \r
+ linkfol = fol;\r
+ }\r
+ \r
+ /* read files */\r
+ for (i = 0; i < fdici.cFiles; i++) {\r
+ if (PFDI_READ(CAB(hfdi), cab->cabhf, buf2, cffile_SIZEOF) != cffile_SIZEOF)\r
+ return DECR_INPUT;\r
+ \r
+ file = (struct fdi_file *) PFDI_ALLOC(CAB(hfdi), sizeof(struct fdi_file));\r
+ if (!file) {\r
+ ERR("out of memory!\n"); \r
+ return DECR_NOMEMORY;\r
+ }\r
+ ZeroMemory(file, sizeof(struct fdi_file));\r
+ if (!(cab->firstfile)) cab->firstfile = file;\r
+ \r
+ file->length = EndGetI32(buf2+cffile_UncompressedSize);\r
+ file->offset = EndGetI32(buf2+cffile_FolderOffset);\r
+ file->index = EndGetI16(buf2+cffile_FolderIndex);\r
+ file->time = EndGetI16(buf2+cffile_Time);\r
+ file->date = EndGetI16(buf2+cffile_Date);\r
+ file->attribs = EndGetI16(buf2+cffile_Attribs);\r
+ file->filename = FDI_read_string(CAB(hfdi), cab->cabhf, fdici.cbCabinet);\r
+ \r
+ if (!file->filename) return DECR_INPUT;\r
+ \r
+ if (linkfile)\r
+ linkfile->next = file;\r
+ linkfile = file;\r
+ }\r
+ \r
+ } else \r
+ cab = cab->next; /* advance to the next cabinet */\r
+\r
+ /* iterate files -- if we encounter the continued file, process it --\r
+ otherwise, jump to the label above and keep looking */\r
+\r
+ for (file = cab->firstfile; (file); file = file->next) {\r
+ if ((file->index & cffileCONTINUED_FROM_PREV) == cffileCONTINUED_FROM_PREV) {\r
+ /* check to ensure a real match */\r
+ if (strcasecmp(fi->filename, file->filename) == 0) {\r
+ success = TRUE;\r
+ if (PFDI_SEEK(CAB(hfdi), cab->cabhf, cab->firstfol->offset, SEEK_SET) == -1)\r
+ return DECR_INPUT;\r
+ break;\r
+ }\r
+ }\r
+ }\r
+ if (!success) goto tryanothercab; /* FIXME: shouldn't this trigger\r
+ "Wrong Cabinet" notification? */\r
+ }\r
+ }\r
+\r
+ /* decompress block */\r
+ if ((err = CAB(decompress)(inlen, outlen, decomp_state)))\r
+ return err;\r
+ CAB(outlen) = outlen;\r
+ CAB(outpos) = CAB(outbuf);\r
+ }\r
+ \r
+ CAB(decomp_cab) = cab;\r
+ return DECR_OK;\r
+}\r
+\r
+/***********************************************************************\r
+ * FDICopy (CABINET.22)\r
+ *\r
+ * Iterates through the files in the Cabinet file indicated by name and\r
+ * file-location. May chain forward to additional cabinets (typically\r
+ * only one) if files which begin in this Cabinet are continued in another\r
+ * cabinet. For each file which is partially contained in this cabinet,\r
+ * and partially contained in a prior cabinet, provides fdintPARTIAL_FILE\r
+ * notification to the pfnfdin callback. For each file which begins in\r
+ * this cabinet, fdintCOPY_FILE notification is provided to the pfnfdin\r
+ * callback, and the file is optionally decompressed and saved to disk.\r
+ * Notification is not provided for files which are not at least partially\r
+ * contained in the specified cabinet file.\r
+ *\r
+ * See below for a thorough explanation of the various notification\r
+ * callbacks.\r
+ *\r
+ * PARAMS\r
+ * hfdi [I] An HFDI from FDICreate\r
+ * pszCabinet [I] C-style string containing the filename of the cabinet\r
+ * pszCabPath [I] C-style string containing the file path of the cabinet\r
+ * flags [I] "Decoder parameters". Ignored. Suggested value: 0.\r
+ * pfnfdin [I] Pointer to a notification function. See CALLBACKS below.\r
+ * pfnfdid [I] Pointer to a decryption function. Ignored. Suggested\r
+ * value: NULL.\r
+ * pvUser [I] arbitrary void * value which is passed to callbacks.\r
+ *\r
+ * RETURNS\r
+ * TRUE if successful.\r
+ * FALSE if unsuccessful (error information is provided in the ERF structure\r
+ * associated with the provided decompression handle by FDICreate).\r
+ *\r
+ * CALLBACKS\r
+ *\r
+ * Two pointers to callback functions are provided as parameters to FDICopy:\r
+ * pfnfdin(of type PFNFDINOTIFY), and pfnfdid (of type PFNFDIDECRYPT). These\r
+ * types are as follows:\r
+ *\r
+ * typedef INT_PTR (__cdecl *PFNFDINOTIFY) ( FDINOTIFICATIONTYPE fdint,\r
+ * PFDINOTIFICATION pfdin );\r
+ *\r
+ * typedef int (__cdecl *PFNFDIDECRYPT) ( PFDIDECRYPT pfdid );\r
+ *\r
+ * You can create functions of this type using the FNFDINOTIFY() and\r
+ * FNFDIDECRYPT() macros, respectively. For example:\r
+ *\r
+ * FNFDINOTIFY(mycallback) {\r
+ * / * use variables fdint and pfdin to process notification * /\r
+ * }\r
+ *\r
+ * The second callback, which could be used for decrypting encrypted data,\r
+ * is not used at all.\r
+ *\r
+ * Each notification informs the user of some event which has occurred during\r
+ * decompression of the cabinet file; each notification is also an opportunity\r
+ * for the callee to abort decompression. The information provided to the\r
+ * callback and the meaning of the callback's return value vary drastically\r
+ * across the various types of notification. The type of notification is the\r
+ * fdint parameter; all other information is provided to the callback in\r
+ * notification-specific parts of the FDINOTIFICATION structure pointed to by\r
+ * pfdin. The only part of that structure which is assigned for every callback\r
+ * is the pv element, which contains the arbitrary value which was passed to\r
+ * FDICopy in the pvUser argument (psz1 is also used each time, but its meaning\r
+ * is highly dependent on fdint).\r
+ * \r
+ * If you encounter unknown notifications, you should return zero if you want\r
+ * decompression to continue (or -1 to abort). All strings used in the\r
+ * callbacks are regular C-style strings. Detailed descriptions of each\r
+ * notification type follow:\r
+ *\r
+ * fdintCABINET_INFO:\r
+ * \r
+ * This is the first notification provided after calling FDICopy, and provides\r
+ * the user with various information about the cabinet. Note that this is\r
+ * called for each cabinet FDICopy opens, not just the first one. In the\r
+ * structure pointed to by pfdin, psz1 contains a pointer to the name of the\r
+ * next cabinet file in the set after the one just loaded (if any), psz2\r
+ * contains a pointer to the name or "info" of the next disk, psz3\r
+ * contains a pointer to the file-path of the current cabinet, setID\r
+ * contains an arbitrary constant associated with this set of cabinet files,\r
+ * and iCabinet contains the numerical index of the current cabinet within\r
+ * that set. Return zero, or -1 to abort.\r
+ *\r
+ * fdintPARTIAL_FILE:\r
+ *\r
+ * This notification is provided when FDICopy encounters a part of a file\r
+ * contained in this cabinet which is missing its beginning. Files can be\r
+ * split across cabinets, so this is not necessarily an abnormality; it just\r
+ * means that the file in question begins in another cabinet. No file\r
+ * corresponding to this notification is extracted from the cabinet. In the\r
+ * structure pointed to by pfdin, psz1 contains a pointer to the name of the\r
+ * partial file, psz2 contains a pointer to the file name of the cabinet in\r
+ * which this file begins, and psz3 contains a pointer to the disk name or\r
+ * "info" of the cabinet where the file begins. Return zero, or -1 to abort.\r
+ *\r
+ * fdintCOPY_FILE:\r
+ *\r
+ * This notification is provided when FDICopy encounters a file which starts\r
+ * in the cabinet file, provided to FDICopy in pszCabinet. (FDICopy will not\r
+ * look for files in cabinets after the first one). One notification will be\r
+ * sent for each such file, before the file is decompressed. By returning\r
+ * zero, the callback can instruct FDICopy to skip the file. In the structure\r
+ * pointed to by pfdin, psz1 contains a pointer to the file's name, cb contains\r
+ * the size of the file (uncompressed), attribs contains the file attributes,\r
+ * and date and time contain the date and time of the file. attributes, date,\r
+ * and time are of the 16-bit ms-dos variety. Return -1 to abort decompression\r
+ * for the entire cabinet, 0 to skip just this file but continue scanning the\r
+ * cabinet for more files, or an FDIClose()-compatible file-handle.\r
+ *\r
+ * fdintCLOSE_FILE_INFO:\r
+ *\r
+ * This notification is important, don't forget to implement it. This\r
+ * notification indicates that a file has been successfully uncompressed and\r
+ * written to disk. Upon receipt of this notification, the callee is expected\r
+ * to close the file handle, to set the attributes and date/time of the\r
+ * closed file, and possibly to execute the file. In the structure pointed to\r
+ * by pfdin, psz1 contains a pointer to the name of the file, hf will be the\r
+ * open file handle (close it), cb contains 1 or zero, indicating respectively\r
+ * that the callee should or should not execute the file, and date, time\r
+ * and attributes will be set as in fdintCOPY_FILE. Bizarrely, the Cabinet SDK\r
+ * specifies that _A_EXEC will be xor'ed out of attributes! wine does not do\r
+ * do so. Return TRUE, or FALSE to abort decompression.\r
+ *\r
+ * fdintNEXT_CABINET:\r
+ *\r
+ * This notification is called when FDICopy must load in another cabinet. This\r
+ * can occur when a file's data is "split" across multiple cabinets. The\r
+ * callee has the opportunity to request that FDICopy look in a different file\r
+ * path for the specified cabinet file, by writing that data into a provided\r
+ * buffer (see below for more information). This notification will be received\r
+ * more than once per-cabinet in the instance that FDICopy failed to find a\r
+ * valid cabinet at the location specified by the first per-cabinet\r
+ * fdintNEXT_CABINET notification. In such instances, the fdie element of the\r
+ * structure pointed to by pfdin indicates the error which prevented FDICopy\r
+ * from proceeding successfully. Return zero to indicate success, or -1 to\r
+ * indicate failure and abort FDICopy.\r
+ *\r
+ * Upon receipt of this notification, the structure pointed to by pfdin will\r
+ * contain the following values: psz1 pointing to the name of the cabinet\r
+ * which FDICopy is attempting to open, psz2 pointing to the name ("info") of\r
+ * the next disk, psz3 pointing to the presumed file-location of the cabinet,\r
+ * and fdie containing either FDIERROR_NONE, or one of the following: \r
+ *\r
+ * FDIERROR_CABINET_NOT_FOUND, FDIERROR_NOT_A_CABINET,\r
+ * FDIERROR_UNKNOWN_CABINET_VERSION, FDIERROR_CORRUPT_CABINET,\r
+ * FDIERROR_BAD_COMPR_TYPE, FDIERROR_RESERVE_MISMATCH, and \r
+ * FDIERROR_WRONG_CABINET.\r
+ *\r
+ * The callee may choose to change the path where FDICopy will look for the\r
+ * cabinet after this notification. To do so, the caller may write the new\r
+ * pathname to the buffer pointed to by psz3, which is 256 characters in\r
+ * length, including the terminating null character, before returning zero.\r
+ *\r
+ * fdintENUMERATE:\r
+ *\r
+ * Undocumented and unimplemented in wine, this seems to be sent each time\r
+ * a cabinet is opened, along with the fdintCABINET_INFO notification. It\r
+ * probably has an interface similar to that of fdintCABINET_INFO; maybe this\r
+ * provides information about the current cabinet instead of the next one....\r
+ * this is just a guess, it has not been looked at closely.\r
+ *\r
+ * INCLUDES\r
+ * fdi.c\r
+ */\r
+BOOL __cdecl FDICopy(\r
+ HFDI hfdi,\r
+ char *pszCabinet,\r
+ char *pszCabPath,\r
+ int flags,\r
+ PFNFDINOTIFY pfnfdin,\r
+ PFNFDIDECRYPT pfnfdid,\r
+ void *pvUser)\r
+{ \r
+ FDICABINETINFO fdici;\r
+ FDINOTIFICATION fdin;\r
+ int cabhf, filehf, idx;\r
+ unsigned int i;\r
+ char fullpath[MAX_PATH];\r
+ size_t pathlen, filenamelen;\r
+ char emptystring = '\0';\r
+ cab_UBYTE buf[64];\r
+ struct fdi_folder *fol = NULL, *linkfol = NULL; \r
+ struct fdi_file *file = NULL, *linkfile = NULL;\r
+ fdi_decomp_state _decomp_state;\r
+ fdi_decomp_state *decomp_state = &_decomp_state;\r
+\r
+ TRACE("(hfdi == ^%p, pszCabinet == ^%p, pszCabPath == ^%p, flags == %0d, \\r
+ pfnfdin == ^%p, pfnfdid == ^%p, pvUser == ^%p)\n",\r
+ hfdi, pszCabinet, pszCabPath, flags, pfnfdin, pfnfdid, pvUser);\r
+\r
+ if (!REALLY_IS_FDI(hfdi)) {\r
+ SetLastError(ERROR_INVALID_HANDLE);\r
+ return FALSE;\r
+ }\r
+\r
+ ZeroMemory(decomp_state, sizeof(fdi_decomp_state));\r
+\r
+ pathlen = (pszCabPath) ? strlen(pszCabPath) : 0;\r
+ filenamelen = (pszCabinet) ? strlen(pszCabinet) : 0;\r
+\r
+ /* slight overestimation here to save CPU cycles in the developer's brain */\r
+ if ((pathlen + filenamelen + 3) > MAX_PATH) {\r
+ ERR("MAX_PATH exceeded.\n");\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_CABINET_NOT_FOUND;\r
+ PFDI_INT(hfdi)->perf->erfType = ERROR_FILE_NOT_FOUND;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ SetLastError(ERROR_FILE_NOT_FOUND);\r
+ return FALSE;\r
+ }\r
+\r
+ /* paste the path and filename together */\r
+ idx = 0;\r
+ if (pathlen) {\r
+ for (i = 0; i < pathlen; i++) fullpath[idx++] = pszCabPath[i];\r
+ if (fullpath[idx - 1] != '\\') fullpath[idx++] = '\\';\r
+ }\r
+ if (filenamelen) for (i = 0; i < filenamelen; i++) fullpath[idx++] = pszCabinet[i];\r
+ fullpath[idx] = '\0';\r
+\r
+ TRACE("full cab path/file name: %s\n", debugstr_a(fullpath));\r
+\r
+ /* get a handle to the cabfile */\r
+ cabhf = PFDI_OPEN(hfdi, fullpath, 32768, _S_IREAD | _S_IWRITE);\r
+ if (cabhf == -1) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_CABINET_NOT_FOUND;\r
+ PFDI_INT(hfdi)->perf->erfType = ERROR_FILE_NOT_FOUND;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ SetLastError(ERROR_FILE_NOT_FOUND);\r
+ return FALSE;\r
+ }\r
+\r
+ if (cabhf == 0) {\r
+ ERR("PFDI_OPEN returned zero for %s.\n", fullpath);\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_CABINET_NOT_FOUND;\r
+ PFDI_INT(hfdi)->perf->erfType = ERROR_FILE_NOT_FOUND;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ SetLastError(ERROR_FILE_NOT_FOUND);\r
+ return FALSE;\r
+ }\r
+\r
+ /* check if it's really a cabfile. Note that this doesn't implement the bug */\r
+ if (!FDI_read_entries(hfdi, cabhf, &fdici, &(CAB(mii)))) {\r
+ ERR("FDIIsCabinet failed.\n");\r
+ PFDI_CLOSE(hfdi, cabhf);\r
+ return FALSE;\r
+ }\r
+ \r
+ /* cabinet notification */\r
+ ZeroMemory(&fdin, sizeof(FDINOTIFICATION));\r
+ fdin.setID = fdici.setID;\r
+ fdin.iCabinet = fdici.iCabinet;\r
+ fdin.pv = pvUser;\r
+ fdin.psz1 = (CAB(mii).nextname) ? CAB(mii).nextname : &emptystring;\r
+ fdin.psz2 = (CAB(mii).nextinfo) ? CAB(mii).nextinfo : &emptystring;\r
+ fdin.psz3 = pszCabPath;\r
+\r
+ if (((*pfnfdin)(fdintCABINET_INFO, &fdin))) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_USER_ABORT;\r
+ PFDI_INT(hfdi)->perf->erfType = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ goto bail_and_fail;\r
+ }\r
+\r
+ CAB(setID) = fdici.setID;\r
+ CAB(iCabinet) = fdici.iCabinet;\r
+\r
+ /* read folders */\r
+ for (i = 0; i < fdici.cFolders; i++) {\r
+ if (PFDI_READ(hfdi, cabhf, buf, cffold_SIZEOF) != cffold_SIZEOF) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_CORRUPT_CABINET;\r
+ PFDI_INT(hfdi)->perf->erfType = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ goto bail_and_fail;\r
+ }\r
+\r
+ if (CAB(mii).folder_resv > 0)\r
+ PFDI_SEEK(hfdi, cabhf, CAB(mii).folder_resv, SEEK_CUR);\r
+\r
+ fol = (struct fdi_folder *) PFDI_ALLOC(hfdi, sizeof(struct fdi_folder));\r
+ if (!fol) {\r
+ ERR("out of memory!\n");\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_ALLOC_FAIL;\r
+ PFDI_INT(hfdi)->perf->erfType = ERROR_NOT_ENOUGH_MEMORY;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ SetLastError(ERROR_NOT_ENOUGH_MEMORY);\r
+ goto bail_and_fail;\r
+ }\r
+ ZeroMemory(fol, sizeof(struct fdi_folder));\r
+ if (!CAB(firstfol)) CAB(firstfol) = fol;\r
+\r
+ fol->offset = (cab_off_t) EndGetI32(buf+cffold_DataOffset);\r
+ fol->num_blocks = EndGetI16(buf+cffold_NumBlocks);\r
+ fol->comp_type = EndGetI16(buf+cffold_CompType);\r
+\r
+ if (linkfol)\r
+ linkfol->next = fol; \r
+ linkfol = fol;\r
+ }\r
+\r
+ /* read files */\r
+ for (i = 0; i < fdici.cFiles; i++) {\r
+ if (PFDI_READ(hfdi, cabhf, buf, cffile_SIZEOF) != cffile_SIZEOF) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_CORRUPT_CABINET;\r
+ PFDI_INT(hfdi)->perf->erfType = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ goto bail_and_fail;\r
+ }\r
+\r
+ file = (struct fdi_file *) PFDI_ALLOC(hfdi, sizeof(struct fdi_file));\r
+ if (!file) { \r
+ ERR("out of memory!\n"); \r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_ALLOC_FAIL;\r
+ PFDI_INT(hfdi)->perf->erfType = ERROR_NOT_ENOUGH_MEMORY;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ SetLastError(ERROR_NOT_ENOUGH_MEMORY);\r
+ goto bail_and_fail;\r
+ }\r
+ ZeroMemory(file, sizeof(struct fdi_file));\r
+ if (!CAB(firstfile)) CAB(firstfile) = file;\r
+ \r
+ file->length = EndGetI32(buf+cffile_UncompressedSize);\r
+ file->offset = EndGetI32(buf+cffile_FolderOffset);\r
+ file->index = EndGetI16(buf+cffile_FolderIndex);\r
+ file->time = EndGetI16(buf+cffile_Time);\r
+ file->date = EndGetI16(buf+cffile_Date);\r
+ file->attribs = EndGetI16(buf+cffile_Attribs);\r
+ file->filename = FDI_read_string(hfdi, cabhf, fdici.cbCabinet);\r
+\r
+ if (!file->filename) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_CORRUPT_CABINET;\r
+ PFDI_INT(hfdi)->perf->erfType = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ goto bail_and_fail;\r
+ }\r
+\r
+ if (linkfile)\r
+ linkfile->next = file;\r
+ linkfile = file;\r
+ }\r
+\r
+ for (file = CAB(firstfile); (file); file = file->next) {\r
+\r
+ /*\r
+ * FIXME: This implementation keeps multiple cabinet files open at once\r
+ * when encountering a split cabinet. It is a quirk of this implementation\r
+ * that sometimes we decrypt the same block of data more than once, to find\r
+ * the right starting point for a file, moving the file-pointer backwards.\r
+ * If we kept a cache of certain file-pointer information, we could eliminate\r
+ * that behavior... in fact I am not sure that the caching we already have\r
+ * is not sufficient.\r
+ * \r
+ * The current implementation seems to work fine in straightforward situations\r
+ * where all the cabinet files needed for decryption are simultaneously\r
+ * available. But presumably, the API is supposed to support cabinets which\r
+ * are split across multiple CDROMS; we may need to change our implementation\r
+ * to strictly serialize it's file usage so that it opens only one cabinet\r
+ * at a time. Some experimentation with Windows is needed to figure out the\r
+ * precise semantics required. The relevant code is here and in fdi_decomp().\r
+ */\r
+\r
+ /* partial-file notification */\r
+ if ((file->index & cffileCONTINUED_FROM_PREV) == cffileCONTINUED_FROM_PREV) {\r
+ /*\r
+ * FIXME: Need to create a Cabinet with a single file spanning multiple files\r
+ * and perform some tests to figure out the right behavior. The SDK says\r
+ * FDICopy will notify the user of the filename and "disk name" (info) of\r
+ * the cabinet where the spanning file /started/.\r
+ *\r
+ * That would certainly be convenient for the API-user, who could abort,\r
+ * everything (or parallelize, if that's allowed (it is in wine)), and call\r
+ * FDICopy again with the provided filename, so as to avoid partial file\r
+ * notification and successfully unpack. This task could be quite unpleasant\r
+ * from wine's perspective: the information specifying the "start cabinet" for\r
+ * a file is associated nowhere with the file header and is not to be found in\r
+ * the cabinet header. We have only the index of the cabinet wherein the folder\r
+ * begins, which contains the file. To find that cabinet, we must consider the\r
+ * index of the current cabinet, and chain backwards, cabinet-by-cabinet (for\r
+ * each cabinet refers to its "next" and "previous" cabinet only, like a linked\r
+ * list).\r
+ *\r
+ * Bear in mind that, in the spirit of CABINET.DLL, we must assume that any\r
+ * cabinet other than the active one might be at another filepath than the\r
+ * current one, or on another CDROM. This could get rather dicey, especially\r
+ * if we imagine parallelized access to the FDICopy API.\r
+ *\r
+ * The current implementation punts -- it just returns the previous cabinet and\r
+ * it's info from the header of this cabinet. This provides the right answer in\r
+ * 95% of the cases; its worth checking if Microsoft cuts the same corner before\r
+ * we "fix" it.\r
+ */\r
+ ZeroMemory(&fdin, sizeof(FDINOTIFICATION));\r
+ fdin.pv = pvUser;\r
+ fdin.psz1 = (char *)file->filename;\r
+ fdin.psz2 = (CAB(mii).prevname) ? CAB(mii).prevname : &emptystring;\r
+ fdin.psz3 = (CAB(mii).previnfo) ? CAB(mii).previnfo : &emptystring;\r
+\r
+ if (((*pfnfdin)(fdintPARTIAL_FILE, &fdin))) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_USER_ABORT;\r
+ PFDI_INT(hfdi)->perf->erfType = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ goto bail_and_fail;\r
+ }\r
+ /* I don't think we are supposed to decompress partial files. This prevents it. */\r
+ file->oppressed = TRUE;\r
+ }\r
+ if (file->oppressed) {\r
+ filehf = 0;\r
+ } else {\r
+ ZeroMemory(&fdin, sizeof(FDINOTIFICATION));\r
+ fdin.pv = pvUser;\r
+ fdin.psz1 = (char *)file->filename;\r
+ fdin.cb = file->length;\r
+ fdin.date = file->date;\r
+ fdin.time = file->time;\r
+ fdin.attribs = file->attribs;\r
+ if ((filehf = ((*pfnfdin)(fdintCOPY_FILE, &fdin))) == -1) {\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_USER_ABORT;\r
+ PFDI_INT(hfdi)->perf->erfType = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ goto bail_and_fail;\r
+ }\r
+ }\r
+\r
+ /* find the folder for this file if necc. */\r
+ if (filehf) {\r
+ int i2;\r
+\r
+ fol = CAB(firstfol);\r
+ if ((file->index & cffileCONTINUED_TO_NEXT) == cffileCONTINUED_TO_NEXT) {\r
+ /* pick the last folder */\r
+ while (fol->next) fol = fol->next;\r
+ } else {\r
+ for (i2 = 0; (i2 < file->index); i2++)\r
+ if (fol->next) /* bug resistance, should always be true */\r
+ fol = fol->next;\r
+ }\r
+ }\r
+\r
+ if (filehf) {\r
+ cab_UWORD comptype = fol->comp_type;\r
+ int ct1 = comptype & cffoldCOMPTYPE_MASK;\r
+ int ct2 = CAB(current) ? (CAB(current)->comp_type & cffoldCOMPTYPE_MASK) : 0;\r
+ int err = 0;\r
+\r
+ TRACE("Extracting file %s as requested by callee.\n", debugstr_a(file->filename));\r
+\r
+ /* set up decomp_state */\r
+ CAB(hfdi) = hfdi;\r
+ CAB(filehf) = filehf;\r
+ CAB(cabhf) = cabhf;\r
+\r
+ /* Was there a change of folder? Compression type? Did we somehow go backwards? */\r
+ if ((ct1 != ct2) || (CAB(current) != fol) || (file->offset < CAB(offset))) {\r
+\r
+ TRACE("Resetting folder for file %s.\n", debugstr_a(file->filename));\r
+\r
+ /* free stuff for the old decompresser */\r
+ switch (ct2) {\r
+ case cffoldCOMPTYPE_LZX:\r
+ if (LZX(window)) {\r
+ PFDI_FREE(hfdi, LZX(window));\r
+ LZX(window) = NULL;\r
+ }\r
+ break;\r
+ case cffoldCOMPTYPE_QUANTUM:\r
+ if (QTM(window)) {\r
+ PFDI_FREE(hfdi, QTM(window));\r
+ QTM(window) = NULL;\r
+ }\r
+ break;\r
+ }\r
+\r
+ CAB(decomp_cab) = NULL;\r
+ PFDI_SEEK(CAB(hfdi), CAB(cabhf), fol->offset, SEEK_SET);\r
+ CAB(offset) = 0;\r
+ CAB(outlen) = 0;\r
+\r
+ /* initialize the new decompresser */\r
+ switch (ct1) {\r
+ case cffoldCOMPTYPE_NONE:\r
+ CAB(decompress) = NONEfdi_decomp;\r
+ break;\r
+ case cffoldCOMPTYPE_MSZIP:\r
+ CAB(decompress) = ZIPfdi_decomp;\r
+ break;\r
+ case cffoldCOMPTYPE_QUANTUM:\r
+ CAB(decompress) = QTMfdi_decomp;\r
+ err = QTMfdi_init((comptype >> 8) & 0x1f, (comptype >> 4) & 0xF, decomp_state);\r
+ break;\r
+ case cffoldCOMPTYPE_LZX:\r
+ CAB(decompress) = LZXfdi_decomp;\r
+ err = LZXfdi_init((comptype >> 8) & 0x1f, decomp_state);\r
+ break;\r
+ default:\r
+ err = DECR_DATAFORMAT;\r
+ }\r
+ }\r
+\r
+ CAB(current) = fol;\r
+\r
+ switch (err) {\r
+ case DECR_OK:\r
+ break;\r
+ case DECR_NOMEMORY:\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_ALLOC_FAIL;\r
+ PFDI_INT(hfdi)->perf->erfType = ERROR_NOT_ENOUGH_MEMORY;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ SetLastError(ERROR_NOT_ENOUGH_MEMORY);\r
+ goto bail_and_fail;\r
+ default:\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_CORRUPT_CABINET;\r
+ PFDI_INT(hfdi)->perf->erfOper = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ goto bail_and_fail;\r
+ }\r
+\r
+ if (file->offset > CAB(offset)) {\r
+ /* decode bytes and send them to /dev/null */\r
+ switch ((err = fdi_decomp(file, 0, decomp_state, pszCabPath, pfnfdin, pvUser))) {\r
+ case DECR_OK:\r
+ break;\r
+ case DECR_USERABORT:\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_USER_ABORT;\r
+ PFDI_INT(hfdi)->perf->erfType = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ goto bail_and_fail;\r
+ case DECR_NOMEMORY:\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_ALLOC_FAIL;\r
+ PFDI_INT(hfdi)->perf->erfType = ERROR_NOT_ENOUGH_MEMORY;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ SetLastError(ERROR_NOT_ENOUGH_MEMORY);\r
+ goto bail_and_fail;\r
+ default:\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_CORRUPT_CABINET;\r
+ PFDI_INT(hfdi)->perf->erfOper = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ goto bail_and_fail;\r
+ }\r
+ CAB(offset) = file->offset;\r
+ }\r
+\r
+ /* now do the actual decompression */\r
+ err = fdi_decomp(file, 1, decomp_state, pszCabPath, pfnfdin, pvUser);\r
+ if (err) CAB(current) = NULL; else CAB(offset) += file->length;\r
+\r
+ switch (err) {\r
+ case DECR_OK:\r
+ break;\r
+ case DECR_USERABORT:\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_USER_ABORT;\r
+ PFDI_INT(hfdi)->perf->erfType = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ goto bail_and_fail;\r
+ case DECR_NOMEMORY:\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_ALLOC_FAIL;\r
+ PFDI_INT(hfdi)->perf->erfType = ERROR_NOT_ENOUGH_MEMORY;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ SetLastError(ERROR_NOT_ENOUGH_MEMORY);\r
+ goto bail_and_fail;\r
+ default:\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_CORRUPT_CABINET;\r
+ PFDI_INT(hfdi)->perf->erfOper = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ goto bail_and_fail;\r
+ }\r
+\r
+ /* fdintCLOSE_FILE_INFO notification */\r
+ ZeroMemory(&fdin, sizeof(FDINOTIFICATION));\r
+ fdin.pv = pvUser;\r
+ fdin.psz1 = (char *)file->filename;\r
+ fdin.hf = filehf;\r
+ fdin.cb = (file->attribs & cffile_A_EXEC) ? TRUE : FALSE; /* FIXME: is that right? */\r
+ fdin.date = file->date;\r
+ fdin.time = file->time;\r
+ fdin.attribs = file->attribs; /* FIXME: filter _A_EXEC? */\r
+ err = ((*pfnfdin)(fdintCLOSE_FILE_INFO, &fdin));\r
+ if (err == FALSE || err == -1) {\r
+ /*\r
+ * SDK states that even though they indicated failure,\r
+ * we are not supposed to try and close the file, so we\r
+ * just treat this like all the others\r
+ */\r
+ PFDI_INT(hfdi)->perf->erfOper = FDIERROR_USER_ABORT;\r
+ PFDI_INT(hfdi)->perf->erfType = 0;\r
+ PFDI_INT(hfdi)->perf->fError = TRUE;\r
+ goto bail_and_fail;\r
+ }\r
+ }\r
+ }\r
+\r
+ /* free decompression temps */\r
+ switch (fol->comp_type & cffoldCOMPTYPE_MASK) {\r
+ case cffoldCOMPTYPE_LZX:\r
+ if (LZX(window)) {\r
+ PFDI_FREE(hfdi, LZX(window));\r
+ LZX(window) = NULL;\r
+ }\r
+ break;\r
+ case cffoldCOMPTYPE_QUANTUM:\r
+ if (QTM(window)) {\r
+ PFDI_FREE(hfdi, QTM(window));\r
+ QTM(window) = NULL;\r
+ }\r
+ break;\r
+ }\r
+\r
+ while (decomp_state) {\r
+ fdi_decomp_state *prev_fds;\r
+\r
+ PFDI_CLOSE(hfdi, CAB(cabhf));\r
+\r
+ /* free the storage remembered by mii */\r
+ if (CAB(mii).nextname) PFDI_FREE(hfdi, CAB(mii).nextname);\r
+ if (CAB(mii).nextinfo) PFDI_FREE(hfdi, CAB(mii).nextinfo);\r
+ if (CAB(mii).prevname) PFDI_FREE(hfdi, CAB(mii).prevname);\r
+ if (CAB(mii).previnfo) PFDI_FREE(hfdi, CAB(mii).previnfo);\r
+\r
+ while (CAB(firstfol)) {\r
+ fol = CAB(firstfol);\r
+ CAB(firstfol) = CAB(firstfol)->next;\r
+ PFDI_FREE(hfdi, fol);\r
+ }\r
+ while (CAB(firstfile)) {\r
+ file = CAB(firstfile);\r
+ if (file->filename) PFDI_FREE(hfdi, (void *)file->filename);\r
+ CAB(firstfile) = CAB(firstfile)->next;\r
+ PFDI_FREE(hfdi, file);\r
+ }\r
+ prev_fds = decomp_state;\r
+ decomp_state = CAB(next);\r
+ if (prev_fds != &_decomp_state)\r
+ PFDI_FREE(hfdi, prev_fds);\r
+ }\r
+ \r
+ return TRUE;\r
+\r
+ bail_and_fail: /* here we free ram before error returns */\r
+\r
+ /* free decompression temps */\r
+ switch (fol->comp_type & cffoldCOMPTYPE_MASK) {\r
+ case cffoldCOMPTYPE_LZX:\r
+ if (LZX(window)) {\r
+ PFDI_FREE(hfdi, LZX(window));\r
+ LZX(window) = NULL;\r
+ }\r
+ break;\r
+ case cffoldCOMPTYPE_QUANTUM:\r
+ if (QTM(window)) {\r
+ PFDI_FREE(hfdi, QTM(window));\r
+ QTM(window) = NULL;\r
+ }\r
+ break;\r
+ }\r
+\r
+ while (decomp_state) {\r
+ fdi_decomp_state *prev_fds;\r
+\r
+ PFDI_CLOSE(hfdi, CAB(cabhf));\r
+\r
+ /* free the storage remembered by mii */\r
+ if (CAB(mii).nextname) PFDI_FREE(hfdi, CAB(mii).nextname);\r
+ if (CAB(mii).nextinfo) PFDI_FREE(hfdi, CAB(mii).nextinfo);\r
+ if (CAB(mii).prevname) PFDI_FREE(hfdi, CAB(mii).prevname);\r
+ if (CAB(mii).previnfo) PFDI_FREE(hfdi, CAB(mii).previnfo);\r
+\r
+ while (CAB(firstfol)) {\r
+ fol = CAB(firstfol);\r
+ CAB(firstfol) = CAB(firstfol)->next;\r
+ PFDI_FREE(hfdi, fol);\r
+ }\r
+ while (CAB(firstfile)) {\r
+ file = CAB(firstfile);\r
+ if (file->filename) PFDI_FREE(hfdi, (void *)file->filename);\r
+ CAB(firstfile) = CAB(firstfile)->next;\r
+ PFDI_FREE(hfdi, file);\r
+ }\r
+ prev_fds = decomp_state;\r
+ decomp_state = CAB(next);\r
+ if (prev_fds != &_decomp_state)\r
+ PFDI_FREE(hfdi, prev_fds);\r
+ }\r
+\r
+ return FALSE;\r
+}\r
+\r
+/***********************************************************************\r
+ * FDIDestroy (CABINET.23)\r
+ *\r
+ * Frees a handle created by FDICreate. Do /not/ call this in the middle\r
+ * of FDICopy. Only reason for failure would be an invalid handle.\r
+ * \r
+ * PARAMS\r
+ * hfdi [I] The HFDI to free\r
+ *\r
+ * RETURNS\r
+ * TRUE for success\r
+ * FALSE for failure\r
+ */\r
+BOOL __cdecl FDIDestroy(HFDI hfdi)\r
+{\r
+ TRACE("(hfdi == ^%p)\n", hfdi);\r
+ if (REALLY_IS_FDI(hfdi)) {\r
+ PFDI_INT(hfdi)->FDI_Intmagic = 0; /* paranoia */\r
+ PFDI_FREE(hfdi, hfdi); /* confusing, but correct */\r
+ return TRUE;\r
+ } else {\r
+ SetLastError(ERROR_INVALID_HANDLE);\r
+ return FALSE;\r
+ }\r
+}\r
+\r
+/***********************************************************************\r
+ * FDITruncateCabinet (CABINET.24)\r
+ *\r
+ * Undocumented and unimplemented.\r
+ */\r
+BOOL __cdecl FDITruncateCabinet(\r
+ HFDI hfdi,\r
+ char *pszCabinetName,\r
+ USHORT iFolderToDelete)\r
+{\r
+ FIXME("(hfdi == ^%p, pszCabinetName == %s, iFolderToDelete == %hu): stub\n",\r
+ hfdi, debugstr_a(pszCabinetName), iFolderToDelete);\r
+\r
+ if (!REALLY_IS_FDI(hfdi)) {\r
+ SetLastError(ERROR_INVALID_HANDLE);\r
+ return FALSE;\r
+ }\r
+\r
+ SetLastError(ERROR_CALL_NOT_IMPLEMENTED);\r
+ return FALSE;\r
+}\r
projects / reactos.git / commitdiff