blob: 0dcb9f486f8ade527ec9cb44a9b80c32be1fb4f0 [file] [log] [blame]
Daniel Veillardadf5ec92012-01-26 16:56:22 +08001/**
2 * xzlib.c: front end for the transparent suport of lzma compression
3 * at the I/O layer, based on an example file from lzma project
4 *
5 * See Copyright for the status of this software.
6 *
7 * Anders F Bjorklund <afb@users.sourceforge.net>
8 */
9#define IN_LIBXML
10#include "libxml.h"
11#ifdef HAVE_LZMA_H
12
13#include <string.h>
14#ifdef HAVE_ERRNO_H
15#include <errno.h>
16#endif
17
18
19#ifdef HAVE_SYS_TYPES_H
20#include <sys/types.h>
21#endif
22#ifdef HAVE_SYS_STAT_H
23#include <sys/stat.h>
24#endif
25#ifdef HAVE_FCNTL_H
26#include <fcntl.h>
27#endif
28#ifdef HAVE_UNISTD_H
29#include <unistd.h>
30#endif
31#ifdef HAVE_STDLIB_H
32#include <stdlib.h>
33#endif
34#ifdef HAVE_ZLIB_H
35#include <zlib.h>
36#endif
37#include <lzma.h>
38
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +020039#include "xzlib.h"
Daniel Veillard9f3cdef2012-05-15 09:38:13 +080040#include <libxml/xmlmemory.h>
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +020041
42/* values for xz_state how */
Daniel Veillardadf5ec92012-01-26 16:56:22 +080043#define LOOK 0 /* look for a gzip/lzma header */
44#define COPY 1 /* copy input directly */
45#define GZIP 2 /* decompress a gzip stream */
46#define LZMA 3 /* decompress a lzma stream */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +020047
48/* internal lzma file state data structure */
49typedef struct {
Daniel Veillardadf5ec92012-01-26 16:56:22 +080050 int mode; /* see lzma modes above */
51 int fd; /* file descriptor */
52 char *path; /* path or fd for error messages */
53 uint64_t pos; /* current position in uncompressed data */
Daniel Veillard72789ef2012-04-02 17:52:20 +080054 unsigned int size; /* buffer size, zero if not allocated yet */
55 unsigned int want; /* requested buffer size, default is BUFSIZ */
Daniel Veillardadf5ec92012-01-26 16:56:22 +080056 unsigned char *in; /* input buffer */
57 unsigned char *out; /* output buffer (double-sized when reading) */
58 unsigned char *next; /* next output data to deliver or write */
Daniel Veillard72789ef2012-04-02 17:52:20 +080059 unsigned int have; /* amount of output data unused at next */
Daniel Veillardadf5ec92012-01-26 16:56:22 +080060 int eof; /* true if end of input file reached */
61 uint64_t start; /* where the lzma data started, for rewinding */
62 uint64_t raw; /* where the raw data started, for seeking */
63 int how; /* 0: get header, 1: copy, 2: decompress */
64 int direct; /* true if last read direct, false if lzma */
65 /* seek request */
66 uint64_t skip; /* amount to skip (already rewound if backwards) */
67 int seek; /* true if seek request pending */
68 /* error information */
69 int err; /* error code */
70 char *msg; /* error message */
71 /* lzma stream */
Daniel Veillard9f3cdef2012-05-15 09:38:13 +080072 int init; /* is the iniflate stream initialized */
Daniel Veillardadf5ec92012-01-26 16:56:22 +080073 lzma_stream strm; /* stream structure in-place (not a pointer) */
74 char padding1[32]; /* padding allowing to cope with possible
75 extensions of above structure without
76 too much side effect */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +020077#ifdef HAVE_ZLIB_H
Daniel Veillardadf5ec92012-01-26 16:56:22 +080078 /* zlib inflate or deflate stream */
79 z_stream zstrm; /* stream structure in-place (not a pointer) */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +020080#endif
Daniel Veillardadf5ec92012-01-26 16:56:22 +080081 char padding2[32]; /* padding allowing to cope with possible
82 extensions of above structure without
83 too much side effect */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +020084} xz_state, *xz_statep;
85
Daniel Veillardadf5ec92012-01-26 16:56:22 +080086static void
87xz_error(xz_statep state, int err, const char *msg)
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +020088{
89 /* free previously allocated message and clear */
90 if (state->msg != NULL) {
91 if (state->err != LZMA_MEM_ERROR)
Daniel Veillard9f3cdef2012-05-15 09:38:13 +080092 xmlFree(state->msg);
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +020093 state->msg = NULL;
94 }
95
96 /* set error code, and if no message, then done */
97 state->err = err;
98 if (msg == NULL)
99 return;
100
101 /* for an out of memory error, save as static string */
102 if (err == LZMA_MEM_ERROR) {
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800103 state->msg = (char *) msg;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200104 return;
105 }
106
107 /* construct error message with path */
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800108 if ((state->msg =
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800109 xmlMalloc(strlen(state->path) + strlen(msg) + 3)) == NULL) {
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200110 state->err = LZMA_MEM_ERROR;
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800111 state->msg = (char *) "out of memory";
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200112 return;
113 }
114 strcpy(state->msg, state->path);
115 strcat(state->msg, ": ");
116 strcat(state->msg, msg);
117 return;
118}
119
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800120static void
121xz_reset(xz_statep state)
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200122{
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800123 state->have = 0; /* no output data available */
124 state->eof = 0; /* not at end of file */
125 state->how = LOOK; /* look for gzip header */
126 state->direct = 1; /* default for empty file */
127 state->seek = 0; /* no seek request pending */
128 xz_error(state, LZMA_OK, NULL); /* clear error */
129 state->pos = 0; /* no uncompressed data yet */
130 state->strm.avail_in = 0; /* no input data yet */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200131#ifdef HAVE_ZLIB_H
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800132 state->zstrm.avail_in = 0; /* no input data yet */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200133#endif
134}
135
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800136static xzFile
137xz_open(const char *path, int fd, const char *mode ATTRIBUTE_UNUSED)
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200138{
139 xz_statep state;
140
141 /* allocate xzFile structure to return */
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800142 state = xmlMalloc(sizeof(xz_state));
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200143 if (state == NULL)
144 return NULL;
145 state->size = 0; /* no buffers allocated yet */
146 state->want = BUFSIZ; /* requested buffer size */
147 state->msg = NULL; /* no error message yet */
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800148 state->init = 0; /* initialization of zlib data */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200149
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800150 /* save the path name for error messages */
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800151 state->path = xmlMalloc(strlen(path) + 1);
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200152 if (state->path == NULL) {
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800153 xmlFree(state);
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200154 return NULL;
155 }
156 strcpy(state->path, path);
157
158 /* open the file with the appropriate mode (or just use fd) */
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800159 state->fd = fd != -1 ? fd : open(path,
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200160#ifdef O_LARGEFILE
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800161 O_LARGEFILE |
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200162#endif
163#ifdef O_BINARY
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800164 O_BINARY |
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200165#endif
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800166 O_RDONLY, 0666);
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200167 if (state->fd == -1) {
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800168 xmlFree(state->path);
169 xmlFree(state);
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200170 return NULL;
171 }
172
173 /* save the current position for rewinding (only if reading) */
174 state->start = lseek(state->fd, 0, SEEK_CUR);
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800175 if (state->start == (uint64_t) - 1)
176 state->start = 0;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200177
178 /* initialize stream */
179 xz_reset(state);
180
181 /* return stream */
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800182 return (xzFile) state;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200183}
184
Daniel Veillard63588f42013-05-10 14:01:46 +0800185static int
186xz_compressed(xzFile f) {
187 xz_statep state;
188
189 if (f == NULL)
190 return(-1);
191 state = (xz_statep) f;
192 if (state->init <= 0)
193 return(-1);
194
195 switch (state->how) {
196 case COPY:
197 return(0);
198 case GZIP:
199 case LZMA:
200 return(1);
201 }
202 return(-1);
203}
204
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800205xzFile
206__libxml2_xzopen(const char *path, const char *mode)
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200207{
208 return xz_open(path, -1, mode);
209}
210
Daniel Veillard63588f42013-05-10 14:01:46 +0800211int
212__libxml2_xzcompressed(xzFile f) {
213 return xz_compressed(f);
214}
215
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800216xzFile
217__libxml2_xzdopen(int fd, const char *mode)
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200218{
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800219 char *path; /* identifier for error messages */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200220 xzFile xz;
221
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800222 if (fd == -1 || (path = xmlMalloc(7 + 3 * sizeof(int))) == NULL)
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200223 return NULL;
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800224 sprintf(path, "<fd:%d>", fd); /* for debugging */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200225 xz = xz_open(path, fd, mode);
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800226 xmlFree(path);
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200227 return xz;
228}
229
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800230static int
Daniel Veillard72789ef2012-04-02 17:52:20 +0800231xz_load(xz_statep state, unsigned char *buf, unsigned int len,
232 unsigned int *have)
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200233{
234 int ret;
235
236 *have = 0;
237 do {
238 ret = read(state->fd, buf + *have, len - *have);
239 if (ret <= 0)
240 break;
241 *have += ret;
242 } while (*have < len);
243 if (ret < 0) {
244 xz_error(state, -1, strerror(errno));
245 return -1;
246 }
247 if (ret == 0)
248 state->eof = 1;
249 return 0;
250}
251
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800252static int
253xz_avail(xz_statep state)
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200254{
255 lzma_stream *strm = &(state->strm);
256
257 if (state->err != LZMA_OK)
258 return -1;
259 if (state->eof == 0) {
Marcus Meissner99644922012-05-07 18:41:42 +0800260 /* avail_in is size_t, which is not necessary sizeof(unsigned) */
261 unsigned tmp = strm->avail_in;
262
263 if (xz_load(state, state->in, state->size, &tmp) == -1) {
264 strm->avail_in = tmp;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200265 return -1;
Marcus Meissner99644922012-05-07 18:41:42 +0800266 }
267 strm->avail_in = tmp;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200268 strm->next_in = state->in;
269 }
270 return 0;
271}
272
Mike Alexandera1313a62013-11-28 23:21:23 +0800273#ifdef HAVE_ZLIB_H
274static int
275xz_avail_zstrm(xz_statep state)
276{
277 int ret;
278 state->strm.avail_in = state->zstrm.avail_in;
279 state->strm.next_in = state->zstrm.next_in;
280 ret = xz_avail(state);
281 state->zstrm.avail_in = (uInt) state->strm.avail_in;
282 state->zstrm.next_in = (Bytef *) state->strm.next_in;
283 return ret;
284}
285#endif
286
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200287static int
288is_format_xz(xz_statep state)
289{
290 lzma_stream *strm = &(state->strm);
291
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800292 return strm->avail_in >= 6 && memcmp(state->in, "\3757zXZ", 6) == 0;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200293}
294
295static int
296is_format_lzma(xz_statep state)
297{
298 lzma_stream *strm = &(state->strm);
299
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800300 lzma_filter filter;
301 lzma_options_lzma *opt;
302 uint32_t dict_size;
303 uint64_t uncompressed_size;
304 size_t i;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200305
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800306 if (strm->avail_in < 13)
307 return 0;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200308
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800309 filter.id = LZMA_FILTER_LZMA1;
310 if (lzma_properties_decode(&filter, NULL, state->in, 5) != LZMA_OK)
311 return 0;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200312
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800313 opt = filter.options;
314 dict_size = opt->dict_size;
Daniel Veillard94431ec2012-05-15 10:45:05 +0800315 free(opt); /* we can't use xmlFree on a string returned by zlib */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200316
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800317 /* A hack to ditch tons of false positives: We allow only dictionary
318 * sizes that are 2^n or 2^n + 2^(n-1) or UINT32_MAX. LZMA_Alone
319 * created only files with 2^n, but accepts any dictionary size.
320 * If someone complains, this will be reconsidered.
321 */
322 if (dict_size != UINT32_MAX) {
323 uint32_t d = dict_size - 1;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200324
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800325 d |= d >> 2;
326 d |= d >> 3;
327 d |= d >> 4;
328 d |= d >> 8;
329 d |= d >> 16;
330 ++d;
331 if (d != dict_size || dict_size == 0)
332 return 0;
333 }
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200334
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800335 /* Another hack to ditch false positives: Assume that if the
336 * uncompressed size is known, it must be less than 256 GiB.
337 * Again, if someone complains, this will be reconsidered.
338 */
339 uncompressed_size = 0;
340 for (i = 0; i < 8; ++i)
341 uncompressed_size |= (uint64_t) (state->in[5 + i]) << (i * 8);
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200342
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800343 if (uncompressed_size != UINT64_MAX
344 && uncompressed_size > (UINT64_C(1) << 38))
345 return 0;
346
347 return 1;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200348}
349
350#ifdef HAVE_ZLIB_H
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800351
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200352/* Get next byte from input, or -1 if end or error. */
353#define NEXT() ((strm->avail_in == 0 && xz_avail(state) == -1) ? -1 : \
354 (strm->avail_in == 0 ? -1 : \
355 (strm->avail_in--, *(strm->next_in)++)))
Mike Alexandera1313a62013-11-28 23:21:23 +0800356/* Same thing, but from zstrm */
357#define NEXTZ() ((strm->avail_in == 0 && xz_avail_zstrm(state) == -1) ? -1 : \
358 (strm->avail_in == 0 ? -1 : \
359 (strm->avail_in--, *(strm->next_in)++)))
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200360
361/* Get a four-byte little-endian integer and return 0 on success and the value
362 in *ret. Otherwise -1 is returned and *ret is not modified. */
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800363static int
364gz_next4(xz_statep state, unsigned long *ret)
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200365{
366 int ch;
367 unsigned long val;
368 z_streamp strm = &(state->zstrm);
369
Mike Alexandera1313a62013-11-28 23:21:23 +0800370 val = NEXTZ();
371 val += (unsigned) NEXTZ() << 8;
372 val += (unsigned long) NEXTZ() << 16;
373 ch = NEXTZ();
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200374 if (ch == -1)
375 return -1;
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800376 val += (unsigned long) ch << 24;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200377 *ret = val;
378 return 0;
379}
380#endif
381
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800382static int
383xz_head(xz_statep state)
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200384{
385 lzma_stream *strm = &(state->strm);
386 lzma_stream init = LZMA_STREAM_INIT;
387 int flags;
388 unsigned len;
389
390 /* allocate read buffers and inflate memory */
391 if (state->size == 0) {
392 /* allocate buffers */
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800393 state->in = xmlMalloc(state->want);
394 state->out = xmlMalloc(state->want << 1);
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200395 if (state->in == NULL || state->out == NULL) {
396 if (state->out != NULL)
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800397 xmlFree(state->out);
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200398 if (state->in != NULL)
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800399 xmlFree(state->in);
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200400 xz_error(state, LZMA_MEM_ERROR, "out of memory");
401 return -1;
402 }
403 state->size = state->want;
404
405 /* allocate decoder memory */
406 state->strm = init;
407 state->strm.avail_in = 0;
408 state->strm.next_in = NULL;
409 if (lzma_auto_decoder(&state->strm, UINT64_MAX, 0) != LZMA_OK) {
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800410 xmlFree(state->out);
411 xmlFree(state->in);
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200412 state->size = 0;
413 xz_error(state, LZMA_MEM_ERROR, "out of memory");
414 return -1;
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800415 }
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200416#ifdef HAVE_ZLIB_H
417 /* allocate inflate memory */
418 state->zstrm.zalloc = Z_NULL;
419 state->zstrm.zfree = Z_NULL;
420 state->zstrm.opaque = Z_NULL;
421 state->zstrm.avail_in = 0;
422 state->zstrm.next_in = Z_NULL;
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800423 if (state->init == 0) {
424 if (inflateInit2(&(state->zstrm), -15) != Z_OK) {/* raw inflate */
425 xmlFree(state->out);
426 xmlFree(state->in);
427 state->size = 0;
428 xz_error(state, LZMA_MEM_ERROR, "out of memory");
429 return -1;
430 }
431 state->init = 1;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200432 }
433#endif
434 }
435
436 /* get some data in the input buffer */
437 if (strm->avail_in == 0) {
438 if (xz_avail(state) == -1)
439 return -1;
440 if (strm->avail_in == 0)
441 return 0;
442 }
443
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800444 /* look for the xz magic header bytes */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200445 if (is_format_xz(state) || is_format_lzma(state)) {
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800446 state->how = LZMA;
447 state->direct = 0;
448 return 0;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200449 }
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200450#ifdef HAVE_ZLIB_H
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800451 /* look for the gzip magic header bytes 31 and 139 */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200452 if (strm->next_in[0] == 31) {
453 strm->avail_in--;
454 strm->next_in++;
455 if (strm->avail_in == 0 && xz_avail(state) == -1)
456 return -1;
457 if (strm->avail_in && strm->next_in[0] == 139) {
458 /* we have a gzip header, woo hoo! */
459 strm->avail_in--;
460 strm->next_in++;
461
462 /* skip rest of header */
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800463 if (NEXT() != 8) { /* compression method */
464 xz_error(state, LZMA_DATA_ERROR,
465 "unknown compression method");
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200466 return -1;
467 }
468 flags = NEXT();
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800469 if (flags & 0xe0) { /* reserved flag bits */
470 xz_error(state, LZMA_DATA_ERROR,
471 "unknown header flags set");
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200472 return -1;
473 }
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800474 NEXT(); /* modification time */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200475 NEXT();
476 NEXT();
477 NEXT();
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800478 NEXT(); /* extra flags */
479 NEXT(); /* operating system */
480 if (flags & 4) { /* extra field */
481 len = (unsigned) NEXT();
482 len += (unsigned) NEXT() << 8;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200483 while (len--)
484 if (NEXT() < 0)
485 break;
486 }
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800487 if (flags & 8) /* file name */
488 while (NEXT() > 0) ;
489 if (flags & 16) /* comment */
490 while (NEXT() > 0) ;
491 if (flags & 2) { /* header crc */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200492 NEXT();
493 NEXT();
494 }
495 /* an unexpected end of file is not checked for here -- it will be
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800496 * noticed on the first request for uncompressed data */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200497
498 /* set up for decompression */
499 inflateReset(&state->zstrm);
500 state->zstrm.adler = crc32(0L, Z_NULL, 0);
501 state->how = GZIP;
502 state->direct = 0;
503 return 0;
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800504 } else {
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200505 /* not a gzip file -- save first byte (31) and fall to raw i/o */
506 state->out[0] = 31;
507 state->have = 1;
508 }
509 }
510#endif
511
512 /* doing raw i/o, save start of raw data for seeking, copy any leftover
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800513 * input to output -- this assumes that the output buffer is larger than
514 * the input buffer, which also assures space for gzungetc() */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200515 state->raw = state->pos;
516 state->next = state->out;
517 if (strm->avail_in) {
518 memcpy(state->next + state->have, strm->next_in, strm->avail_in);
519 state->have += strm->avail_in;
520 strm->avail_in = 0;
521 }
522 state->how = COPY;
523 state->direct = 1;
524 return 0;
525}
526
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800527static int
528xz_decomp(xz_statep state)
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200529{
530 int ret;
531 unsigned had;
532 unsigned long crc, len;
533 lzma_stream *strm = &(state->strm);
534
535 lzma_action action = LZMA_RUN;
536
537 /* fill output buffer up to end of deflate stream */
538 had = strm->avail_out;
539 do {
540 /* get more input for inflate() */
541 if (strm->avail_in == 0 && xz_avail(state) == -1)
542 return -1;
543 if (strm->avail_in == 0) {
544 xz_error(state, LZMA_DATA_ERROR, "unexpected end of file");
545 return -1;
546 }
547 if (state->eof)
548 action = LZMA_FINISH;
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800549
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200550 /* decompress and handle errors */
551#ifdef HAVE_ZLIB_H
552 if (state->how == GZIP) {
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800553 state->zstrm.avail_in = (uInt) state->strm.avail_in;
554 state->zstrm.next_in = (Bytef *) state->strm.next_in;
555 state->zstrm.avail_out = (uInt) state->strm.avail_out;
556 state->zstrm.next_out = (Bytef *) state->strm.next_out;
557 ret = inflate(&state->zstrm, Z_NO_FLUSH);
558 if (ret == Z_STREAM_ERROR || ret == Z_NEED_DICT) {
559 xz_error(state, Z_STREAM_ERROR,
560 "internal error: inflate stream corrupt");
561 return -1;
562 }
563 if (ret == Z_MEM_ERROR)
564 ret = LZMA_MEM_ERROR;
565 if (ret == Z_DATA_ERROR)
566 ret = LZMA_DATA_ERROR;
567 if (ret == Z_STREAM_END)
568 ret = LZMA_STREAM_END;
569 state->strm.avail_in = state->zstrm.avail_in;
570 state->strm.next_in = state->zstrm.next_in;
571 state->strm.avail_out = state->zstrm.avail_out;
572 state->strm.next_out = state->zstrm.next_out;
573 } else /* state->how == LZMA */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200574#endif
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800575 ret = lzma_code(strm, action);
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200576 if (ret == LZMA_MEM_ERROR) {
577 xz_error(state, LZMA_MEM_ERROR, "out of memory");
578 return -1;
579 }
580 if (ret == LZMA_DATA_ERROR) {
581 xz_error(state, LZMA_DATA_ERROR, "compressed data error");
582 return -1;
583 }
584 } while (strm->avail_out && ret != LZMA_STREAM_END);
585
586 /* update available output and crc check value */
587 state->have = had - strm->avail_out;
588 state->next = strm->next_out - state->have;
589#ifdef HAVE_ZLIB_H
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800590 state->zstrm.adler =
591 crc32(state->zstrm.adler, state->next, state->have);
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200592#endif
593
594 if (ret == LZMA_STREAM_END) {
595#ifdef HAVE_ZLIB_H
596 if (state->how == GZIP) {
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800597 if (gz_next4(state, &crc) == -1 || gz_next4(state, &len) == -1) {
598 xz_error(state, LZMA_DATA_ERROR, "unexpected end of file");
599 return -1;
600 }
601 if (crc != state->zstrm.adler) {
602 xz_error(state, LZMA_DATA_ERROR, "incorrect data check");
603 return -1;
604 }
605 if (len != (state->zstrm.total_out & 0xffffffffL)) {
606 xz_error(state, LZMA_DATA_ERROR, "incorrect length check");
607 return -1;
608 }
609 state->strm.avail_in = 0;
610 state->strm.next_in = NULL;
611 state->strm.avail_out = 0;
612 state->strm.next_out = NULL;
613 } else
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200614#endif
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800615 if (strm->avail_in != 0 || !state->eof) {
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200616 xz_error(state, LZMA_DATA_ERROR, "trailing garbage");
617 return -1;
618 }
619 state->how = LOOK; /* ready for next stream, once have is 0 (leave
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800620 * state->direct unchanged to remember how) */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200621 }
622
623 /* good decompression */
624 return 0;
625}
626
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800627static int
628xz_make(xz_statep state)
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200629{
630 lzma_stream *strm = &(state->strm);
631
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800632 if (state->how == LOOK) { /* look for lzma / gzip header */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200633 if (xz_head(state) == -1)
634 return -1;
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800635 if (state->have) /* got some data from xz_head() */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200636 return 0;
637 }
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800638 if (state->how == COPY) { /* straight copy */
639 if (xz_load(state, state->out, state->size << 1, &(state->have)) ==
640 -1)
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200641 return -1;
642 state->next = state->out;
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800643 } else if (state->how == LZMA || state->how == GZIP) { /* decompress */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200644 strm->avail_out = state->size << 1;
645 strm->next_out = state->out;
646 if (xz_decomp(state) == -1)
647 return -1;
648 }
649 return 0;
650}
651
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800652static int
653xz_skip(xz_statep state, uint64_t len)
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200654{
655 unsigned n;
656
657 /* skip over len bytes or reach end-of-file, whichever comes first */
658 while (len)
659 /* skip over whatever is in output buffer */
660 if (state->have) {
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800661 n = (uint64_t) state->have > len ?
662 (unsigned) len : state->have;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200663 state->have -= n;
664 state->next += n;
665 state->pos += n;
666 len -= n;
667 }
668
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800669 /* output buffer empty -- return if we're at the end of the input */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200670 else if (state->eof && state->strm.avail_in == 0)
671 break;
672
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800673 /* need more data to skip -- load up output buffer */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200674 else {
675 /* get more output, looking for header if required */
676 if (xz_make(state) == -1)
677 return -1;
678 }
679 return 0;
680}
681
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800682int
683__libxml2_xzread(xzFile file, void *buf, unsigned len)
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200684{
685 unsigned got, n;
686 xz_statep state;
687 lzma_stream *strm;
688
689 /* get internal structure */
690 if (file == NULL)
691 return -1;
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800692 state = (xz_statep) file;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200693 strm = &(state->strm);
694
695 /* check that we're reading and that there's no error */
696 if (state->err != LZMA_OK)
697 return -1;
698
699 /* since an int is returned, make sure len fits in one, otherwise return
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800700 * with an error (this avoids the flaw in the interface) */
701 if ((int) len < 0) {
702 xz_error(state, LZMA_BUF_ERROR,
703 "requested length does not fit in int");
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200704 return -1;
705 }
706
707 /* if len is zero, avoid unnecessary operations */
708 if (len == 0)
709 return 0;
710
711 /* process a skip request */
712 if (state->seek) {
713 state->seek = 0;
714 if (xz_skip(state, state->skip) == -1)
715 return -1;
716 }
717
718 /* get len bytes to buf, or less than len if at the end */
719 got = 0;
720 do {
721 /* first just try copying data from the output buffer */
722 if (state->have) {
723 n = state->have > len ? len : state->have;
724 memcpy(buf, state->next, n);
725 state->next += n;
726 state->have -= n;
727 }
728
729 /* output buffer empty -- return if we're at the end of the input */
730 else if (state->eof && strm->avail_in == 0)
731 break;
732
733 /* need output data -- for small len or new stream load up our output
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800734 * buffer */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200735 else if (state->how == LOOK || len < (state->size << 1)) {
736 /* get more output, looking for header if required */
737 if (xz_make(state) == -1)
738 return -1;
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800739 continue; /* no progress yet -- go back to memcpy() above */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200740 /* the copy above assures that we will leave with space in the
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800741 * output buffer, allowing at least one gzungetc() to succeed */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200742 }
743
744 /* large len -- read directly into user buffer */
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800745 else if (state->how == COPY) { /* read directly */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200746 if (xz_load(state, buf, len, &n) == -1)
747 return -1;
748 }
749
750 /* large len -- decompress directly into user buffer */
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800751 else { /* state->how == LZMA */
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200752 strm->avail_out = len;
753 strm->next_out = buf;
754 if (xz_decomp(state) == -1)
755 return -1;
756 n = state->have;
757 state->have = 0;
758 }
759
760 /* update progress */
761 len -= n;
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800762 buf = (char *) buf + n;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200763 got += n;
764 state->pos += n;
765 } while (len);
766
767 /* return number of bytes read into user buffer (will fit in int) */
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800768 return (int) got;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200769}
770
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800771int
772__libxml2_xzclose(xzFile file)
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200773{
774 int ret;
775 xz_statep state;
776
777 /* get internal structure */
778 if (file == NULL)
779 return LZMA_DATA_ERROR;
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800780 state = (xz_statep) file;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200781
782 /* free memory and close file */
783 if (state->size) {
784 lzma_end(&(state->strm));
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800785#ifdef HAVE_ZLIB_H
786 if (state->init == 1)
787 inflateEnd(&(state->zstrm));
788 state->init = 0;
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200789#endif
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800790 xmlFree(state->out);
791 xmlFree(state->in);
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200792 }
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800793 xmlFree(state->path);
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200794 ret = close(state->fd);
Daniel Veillard9f3cdef2012-05-15 09:38:13 +0800795 xmlFree(state);
Anders F Bjorklund6bdc7742011-09-19 09:53:20 +0200796 return ret ? ret : LZMA_OK;
797}
Daniel Veillardadf5ec92012-01-26 16:56:22 +0800798#endif /* HAVE_LZMA_H */