diff options
author | Glenn L McGrath <bug1@ihug.co.nz> | 2002-09-25 02:47:48 +0000 |
---|---|---|
committer | Glenn L McGrath <bug1@ihug.co.nz> | 2002-09-25 02:47:48 +0000 |
commit | 7ca04f328e22fcbee4659d73f9a72dfdf1dd6a23 (patch) | |
tree | f38c7ef4317eea28c6abdb0adbbb286fe041711e /archival/libunarchive | |
parent | ecfa290cfd4953598e6d91989bd66ac16e135f84 (diff) | |
download | busybox-w32-7ca04f328e22fcbee4659d73f9a72dfdf1dd6a23.tar.gz busybox-w32-7ca04f328e22fcbee4659d73f9a72dfdf1dd6a23.tar.bz2 busybox-w32-7ca04f328e22fcbee4659d73f9a72dfdf1dd6a23.zip |
New common unarchive code.
Diffstat (limited to 'archival/libunarchive')
23 files changed, 1277 insertions, 1026 deletions
diff --git a/archival/libunarchive/Makefile.in b/archival/libunarchive/Makefile.in index cd68be732..e2ac546ab 100644 --- a/archival/libunarchive/Makefile.in +++ b/archival/libunarchive/Makefile.in | |||
@@ -22,14 +22,41 @@ ifndef $(LIBUNARCHIVE_DIR) | |||
22 | LIBUNARCHIVE_DIR:=$(TOPDIR)archival/libunarchive/ | 22 | LIBUNARCHIVE_DIR:=$(TOPDIR)archival/libunarchive/ |
23 | endif | 23 | endif |
24 | 24 | ||
25 | LIBUNARCHIVE-y:=unarchive.o seek_sub_file.o | 25 | LIBUNARCHIVE-y:= \ |
26 | LIBUNARCHIVE-$(CONFIG_DPKG) += deb_extract.o get_header_ar.o get_header_tar.o | 26 | \ |
27 | LIBUNARCHIVE-$(CONFIG_DPKG_DEB) += deb_extract.o get_header_ar.o get_header_tar.o | 27 | data_skip.o \ |
28 | LIBUNARCHIVE-$(CONFIG_AR) += get_header_ar.o | 28 | data_extract_all.o \ |
29 | LIBUNARCHIVE-$(CONFIG_CPIO) += get_header_cpio.o | 29 | data_extract_to_stdout.o \ |
30 | LIBUNARCHIVE-$(CONFIG_RPM2CPIO) += get_header_cpio.o | 30 | \ |
31 | LIBUNARCHIVE-$(CONFIG_TAR) += get_header_tar.o | 31 | filter_accept_all.o \ |
32 | LIBUNARCHIVE-$(CONFIG_UNZIP) += get_header_zip.o | 32 | filter_accept_list.o \ |
33 | filter_accept_reject_list.o \ | ||
34 | \ | ||
35 | get_header_ar.o \ | ||
36 | get_header_tar.o \ | ||
37 | get_header_tar_gz.o \ | ||
38 | \ | ||
39 | header_skip.o \ | ||
40 | header_list.o \ | ||
41 | header_verbose_list.o \ | ||
42 | \ | ||
43 | add_to_list.o \ | ||
44 | check_header_gzip.o \ | ||
45 | check_trailer_gzip.o \ | ||
46 | copy_file_chunk_fd.o \ | ||
47 | data_align.o \ | ||
48 | init_handle.o \ | ||
49 | seek_sub_file.o \ | ||
50 | unpack_ar_archive.o \ | ||
51 | |||
52 | LIBUNARCHIVE-$(CONFIG_DPKG) += | ||
53 | LIBUNARCHIVE-$(CONFIG_DPKG_DEB) += | ||
54 | LIBUNARCHIVE-$(CONFIG_AR) += | ||
55 | LIBUNARCHIVE-$(CONFIG_CPIO) += | ||
56 | LIBUNARCHIVE-$(CONFIG_GUNZIP) += | ||
57 | LIBUNARCHIVE-$(CONFIG_RPM2CPIO) += | ||
58 | LIBUNARCHIVE-$(CONFIG_TAR) += | ||
59 | LIBUNARCHIVE-$(CONFIG_UNZIP) += | ||
33 | 60 | ||
34 | libraries-y+=$(LIBUNARCHIVE_DIR)$(LIBUNARCHIVE_AR) | 61 | libraries-y+=$(LIBUNARCHIVE_DIR)$(LIBUNARCHIVE_AR) |
35 | 62 | ||
diff --git a/archival/libunarchive/add_to_list.c b/archival/libunarchive/add_to_list.c new file mode 100644 index 000000000..052bca351 --- /dev/null +++ b/archival/libunarchive/add_to_list.c | |||
@@ -0,0 +1,15 @@ | |||
1 | #include <stdlib.h> | ||
2 | #include <string.h> | ||
3 | #include "unarchive.h" | ||
4 | #include "libbb.h" | ||
5 | |||
6 | extern const llist_t *add_to_list(const llist_t *old_head, const char *new_item) | ||
7 | { | ||
8 | llist_t *new_head; | ||
9 | |||
10 | new_head = xmalloc(sizeof(llist_t)); | ||
11 | new_head->data = new_item; | ||
12 | new_head->link = old_head; | ||
13 | |||
14 | return(new_head); | ||
15 | } | ||
diff --git a/archival/libunarchive/check_header_gzip.c b/archival/libunarchive/check_header_gzip.c new file mode 100644 index 000000000..508d30924 --- /dev/null +++ b/archival/libunarchive/check_header_gzip.c | |||
@@ -0,0 +1,75 @@ | |||
1 | #include <stdlib.h> | ||
2 | #include <unistd.h> | ||
3 | #include "libbb.h" | ||
4 | |||
5 | extern void check_header_gzip(int src_fd) | ||
6 | { | ||
7 | union { | ||
8 | unsigned char raw[10]; | ||
9 | struct { | ||
10 | unsigned char magic[2]; | ||
11 | unsigned char method; | ||
12 | unsigned char flags; | ||
13 | unsigned int mtime; | ||
14 | unsigned char xtra_flags; | ||
15 | unsigned char os_flags; | ||
16 | } formated; | ||
17 | } header; | ||
18 | |||
19 | xread_all(src_fd, header.raw, 10); | ||
20 | |||
21 | /* Magic header for gzip files, 1F 8B = \037\213 */ | ||
22 | if ((header.formated.magic[0] != 0x1F) | ||
23 | || (header.formated.magic[1] != 0x8b)) { | ||
24 | error_msg_and_die("Invalid gzip magic"); | ||
25 | } | ||
26 | |||
27 | /* Check the compression method */ | ||
28 | if (header.formated.method != 8) { | ||
29 | error_msg_and_die("Unknown compression method %d", | ||
30 | header.formated.method); | ||
31 | } | ||
32 | |||
33 | if (header.formated.flags & 0x04) { | ||
34 | /* bit 2 set: extra field present */ | ||
35 | unsigned char extra_short; | ||
36 | |||
37 | extra_short = xread_char(src_fd); | ||
38 | extra_short += xread_char(src_fd) << 8; | ||
39 | while (extra_short > 0) { | ||
40 | /* Ignore extra field */ | ||
41 | xread_char(src_fd); | ||
42 | extra_short--; | ||
43 | } | ||
44 | } | ||
45 | |||
46 | /* Discard original name if any */ | ||
47 | if (header.formated.flags & 0x08) { | ||
48 | /* bit 3 set: original file name present */ | ||
49 | char tmp; | ||
50 | |||
51 | do { | ||
52 | read(src_fd, &tmp, 1); | ||
53 | } while (tmp != 0); | ||
54 | } | ||
55 | |||
56 | /* Discard file comment if any */ | ||
57 | if (header.formated.flags & 0x10) { | ||
58 | /* bit 4 set: file comment present */ | ||
59 | char tmp; | ||
60 | |||
61 | do { | ||
62 | read(src_fd, &tmp, 1); | ||
63 | } while (tmp != 0); | ||
64 | } | ||
65 | |||
66 | /* Read the header checksum */ | ||
67 | if (header.formated.flags & 0x02) { | ||
68 | char tmp; | ||
69 | |||
70 | read(src_fd, &tmp, 1); | ||
71 | read(src_fd, &tmp, 1); | ||
72 | } | ||
73 | |||
74 | return; | ||
75 | } | ||
diff --git a/archival/libunarchive/check_trailer_gzip.c b/archival/libunarchive/check_trailer_gzip.c new file mode 100644 index 000000000..215e8293f --- /dev/null +++ b/archival/libunarchive/check_trailer_gzip.c | |||
@@ -0,0 +1,62 @@ | |||
1 | /* vi: set sw=4 ts=4: */ | ||
2 | /* | ||
3 | * busybox gunzip trailing header handler | ||
4 | * Copyright Glenn McGrath 2002 | ||
5 | * | ||
6 | * This program is free software; you can redistribute it and/or modify | ||
7 | * it under the terms of the GNU General Public License as published by | ||
8 | * the Free Software Foundation; either version 2 of the License, or | ||
9 | * (at your option) any later version. | ||
10 | * | ||
11 | * This program is distributed in the hope that it will be useful, | ||
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
14 | * GNU General Public License for more details. | ||
15 | * | ||
16 | * You should have received a copy of the GNU General Public License | ||
17 | * along with this program; if not, write to the Free Software | ||
18 | * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. | ||
19 | */ | ||
20 | |||
21 | |||
22 | #include <sys/types.h> | ||
23 | #include <sys/wait.h> | ||
24 | #include <signal.h> | ||
25 | #include <stdlib.h> | ||
26 | #include <string.h> | ||
27 | #include <unistd.h> | ||
28 | #include <fcntl.h> | ||
29 | #include "config.h" | ||
30 | #include "busybox.h" | ||
31 | #include "unarchive.h" | ||
32 | |||
33 | extern unsigned int gunzip_crc; | ||
34 | extern unsigned int gunzip_bytes_out; | ||
35 | extern unsigned char *gunzip_in_buffer; | ||
36 | extern unsigned char gunzip_in_buffer_count; | ||
37 | |||
38 | extern void check_trailer_gzip(int src_fd) | ||
39 | { | ||
40 | |||
41 | unsigned int stored_crc = 0; | ||
42 | unsigned char count; | ||
43 | |||
44 | /* top up the input buffer with the rest of the trailer */ | ||
45 | xread_all(src_fd, &gunzip_in_buffer[gunzip_in_buffer_count], 8 - gunzip_in_buffer_count); | ||
46 | for (count = 0; count != 4; count++) { | ||
47 | stored_crc |= (gunzip_in_buffer[count] << (count * 8)); | ||
48 | } | ||
49 | |||
50 | /* Validate decompression - crc */ | ||
51 | if (stored_crc != (gunzip_crc ^ 0xffffffffL)) { | ||
52 | error_msg("invalid compressed data--crc error"); | ||
53 | } | ||
54 | |||
55 | /* Validate decompression - size */ | ||
56 | if (gunzip_bytes_out != | ||
57 | (gunzip_in_buffer[4] | (gunzip_in_buffer[5] << 8) | | ||
58 | (gunzip_in_buffer[6] << 16) | (gunzip_in_buffer[7] << 24))) { | ||
59 | error_msg("invalid compressed data--length error"); | ||
60 | } | ||
61 | |||
62 | } | ||
diff --git a/archival/libunarchive/copy_file_chunk_fd.c b/archival/libunarchive/copy_file_chunk_fd.c new file mode 100644 index 000000000..fb513e6d5 --- /dev/null +++ b/archival/libunarchive/copy_file_chunk_fd.c | |||
@@ -0,0 +1,33 @@ | |||
1 | #include <unistd.h> | ||
2 | #include <sys/types.h> | ||
3 | #include "libbb.h" | ||
4 | |||
5 | /* Copy CHUNKSIZE bytes (or untill EOF if chunksize == -1) | ||
6 | * from SRC_FILE to DST_FILE. */ | ||
7 | extern int copy_file_chunk_fd(int src_fd, int dst_fd, off_t chunksize) | ||
8 | { | ||
9 | size_t nread, size; | ||
10 | char buffer[BUFSIZ]; | ||
11 | |||
12 | while (chunksize != 0) { | ||
13 | if (chunksize > BUFSIZ) { | ||
14 | size = BUFSIZ; | ||
15 | } else { | ||
16 | size = chunksize; | ||
17 | } | ||
18 | nread = xread(src_fd, buffer, size); | ||
19 | if (nread == 0) { | ||
20 | return 1; | ||
21 | } | ||
22 | |||
23 | if (write (dst_fd, buffer, nread) != nread) { | ||
24 | error_msg_and_die ("Short write"); | ||
25 | } | ||
26 | |||
27 | if (chunksize != -1) { | ||
28 | chunksize -= nread; | ||
29 | } | ||
30 | } | ||
31 | |||
32 | return 0; | ||
33 | } | ||
diff --git a/archival/libunarchive/data_align.c b/archival/libunarchive/data_align.c new file mode 100644 index 000000000..d6243bc19 --- /dev/null +++ b/archival/libunarchive/data_align.c | |||
@@ -0,0 +1,13 @@ | |||
1 | #include <errno.h> | ||
2 | #include <sys/types.h> | ||
3 | #include <unistd.h> | ||
4 | #include "unarchive.h" | ||
5 | #include "libbb.h" | ||
6 | |||
7 | extern const unsigned short data_align(const int src_fd, const unsigned int offset, const unsigned short align_to) | ||
8 | { | ||
9 | const unsigned short skip_amount = (align_to - (offset % align_to)) % align_to; | ||
10 | seek_sub_file(src_fd, skip_amount); | ||
11 | |||
12 | return(skip_amount); | ||
13 | } | ||
diff --git a/archival/libunarchive/data_extract_all.c b/archival/libunarchive/data_extract_all.c new file mode 100644 index 000000000..20d99aa58 --- /dev/null +++ b/archival/libunarchive/data_extract_all.c | |||
@@ -0,0 +1,76 @@ | |||
1 | #include <sys/types.h> | ||
2 | #include <errno.h> | ||
3 | #include <fcntl.h> | ||
4 | #include <stdlib.h> | ||
5 | #include <string.h> | ||
6 | #include <utime.h> | ||
7 | #include <unistd.h> | ||
8 | #include <stdlib.h> | ||
9 | #include "libbb.h" | ||
10 | #include "unarchive.h" | ||
11 | |||
12 | extern void data_extract_all(archive_handle_t *archive_handle) | ||
13 | { | ||
14 | file_header_t *file_header = archive_handle->file_header; | ||
15 | int dst_fd; | ||
16 | int res; | ||
17 | |||
18 | if (archive_handle->flags & ARCHIVE_CREATE_LEADING_DIRS) { | ||
19 | char *dir = dirname(strdup(file_header->name)); | ||
20 | make_directory (dir, 0777, FILEUTILS_RECUR); | ||
21 | free(dir); | ||
22 | } | ||
23 | |||
24 | /* Create the file */ | ||
25 | switch(file_header->mode & S_IFMT) { | ||
26 | case S_IFREG: { | ||
27 | #ifdef CONFIG_CPIO | ||
28 | if (file_header->link_name) { | ||
29 | /* hard link */ | ||
30 | res = link(file_header->link_name, file_header->name); | ||
31 | if ((res == -1) && !(archive_handle->flags & ARCHIVE_EXTRACT_QUIET)) { | ||
32 | perror_msg("Couldnt create hard link"); | ||
33 | } | ||
34 | } else | ||
35 | #endif | ||
36 | { | ||
37 | /* Regular file */ | ||
38 | dst_fd = xopen(file_header->name, O_WRONLY | O_CREAT); | ||
39 | copy_file_chunk_fd(archive_handle->src_fd, dst_fd, file_header->size); | ||
40 | close(dst_fd); | ||
41 | } | ||
42 | break; | ||
43 | } | ||
44 | case S_IFDIR: | ||
45 | res = mkdir(file_header->name, file_header->mode); | ||
46 | if ((res == -1) && !(archive_handle->flags & ARCHIVE_EXTRACT_QUIET)) { | ||
47 | perror_msg("extract_archive: %s", file_header->name); | ||
48 | } | ||
49 | break; | ||
50 | case S_IFLNK: | ||
51 | /* Symlink */ | ||
52 | res = symlink(file_header->link_name, file_header->name); | ||
53 | if ((res == -1) && !(archive_handle->flags & ARCHIVE_EXTRACT_QUIET)) { | ||
54 | perror_msg("Cannot create symlink from %s to '%s'", file_header->name, file_header->link_name); | ||
55 | } | ||
56 | break; | ||
57 | case S_IFSOCK: | ||
58 | case S_IFBLK: | ||
59 | case S_IFCHR: | ||
60 | case S_IFIFO: | ||
61 | res = mknod(file_header->name, file_header->mode, file_header->device); | ||
62 | if ((res == -1) && !(archive_handle->flags & ARCHIVE_EXTRACT_QUIET)) { | ||
63 | perror_msg("Cannot create node %s", file_header->name); | ||
64 | } | ||
65 | break; | ||
66 | } | ||
67 | |||
68 | chmod(file_header->name, file_header->mode); | ||
69 | chown(file_header->name, file_header->uid, file_header->gid); | ||
70 | |||
71 | if (archive_handle->flags & ARCHIVE_PRESERVE_DATE) { | ||
72 | struct utimbuf t; | ||
73 | t.actime = t.modtime = file_header->mtime; | ||
74 | utime(file_header->name, &t); | ||
75 | } | ||
76 | } | ||
diff --git a/archival/libunarchive/data_extract_to_stdout.c b/archival/libunarchive/data_extract_to_stdout.c new file mode 100644 index 000000000..00687b315 --- /dev/null +++ b/archival/libunarchive/data_extract_to_stdout.c | |||
@@ -0,0 +1,8 @@ | |||
1 | #include <stdlib.h> | ||
2 | #include <stdio.h> | ||
3 | #include "unarchive.h" | ||
4 | |||
5 | extern void data_extract_to_stdout(archive_handle_t *archive_handle) | ||
6 | { | ||
7 | copy_file_chunk_fd(archive_handle->src_fd, fileno(stdout), archive_handle->file_header->size); | ||
8 | } | ||
diff --git a/archival/libunarchive/data_skip.c b/archival/libunarchive/data_skip.c new file mode 100644 index 000000000..4e63d4304 --- /dev/null +++ b/archival/libunarchive/data_skip.c | |||
@@ -0,0 +1,27 @@ | |||
1 | /* | ||
2 | * This program is free software; you can redistribute it and/or modify | ||
3 | * it under the terms of the GNU General Public License as published by | ||
4 | * the Free Software Foundation; either version 2 of the License, or | ||
5 | * (at your option) any later version. | ||
6 | * | ||
7 | * This program is distributed in the hope that it will be useful, | ||
8 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
9 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
10 | * GNU General Public License for more details. | ||
11 | * | ||
12 | * You should have received a copy of the GNU General Public License | ||
13 | * along with this program; if not, write to the Free Software | ||
14 | * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. | ||
15 | */ | ||
16 | |||
17 | #include <sys/types.h> | ||
18 | #include <errno.h> | ||
19 | #include <unistd.h> | ||
20 | #include <stdlib.h> | ||
21 | #include "unarchive.h" | ||
22 | #include "libbb.h" | ||
23 | |||
24 | extern void data_skip(archive_handle_t *archive_handle) | ||
25 | { | ||
26 | seek_sub_file(archive_handle->src_fd, archive_handle->file_header->size); | ||
27 | } | ||
diff --git a/archival/libunarchive/decompress_unzip.c b/archival/libunarchive/decompress_unzip.c index d84067068..20bf88f55 100644 --- a/archival/libunarchive/decompress_unzip.c +++ b/archival/libunarchive/decompress_unzip.c | |||
@@ -65,114 +65,126 @@ static char *license_msg[] = { | |||
65 | #include <signal.h> | 65 | #include <signal.h> |
66 | #include <stdlib.h> | 66 | #include <stdlib.h> |
67 | #include <string.h> | 67 | #include <string.h> |
68 | #include <unistd.h> | ||
69 | #include <fcntl.h> | ||
68 | #include "config.h" | 70 | #include "config.h" |
69 | #include "libbb.h" | 71 | #include "busybox.h" |
72 | #include "unarchive.h" | ||
70 | 73 | ||
71 | #ifdef CONFIG_FEATURE_UNCOMPRESS | 74 | typedef struct huft_s { |
72 | int uncompress(FILE * in, FILE * out); | 75 | unsigned char e; /* number of extra bits or operation */ |
73 | #endif | 76 | unsigned char b; /* number of bits in this code or subcode */ |
74 | 77 | union { | |
75 | static FILE *in_file, *out_file; | 78 | unsigned short n; /* literal, length base, or distance base */ |
79 | struct huft_s *t; /* pointer to next level of table */ | ||
80 | } v; | ||
81 | } huft_t; | ||
76 | 82 | ||
77 | /* these are freed by gz_close */ | 83 | static int gunzip_src_fd; |
78 | static unsigned char *window; | 84 | static int gunzip_dst_fd; |
79 | static unsigned long *crc_table; | 85 | unsigned int gunzip_bytes_out; /* number of output bytes */ |
86 | static unsigned int gunzip_outbuf_count; /* bytes in output buffer */ | ||
80 | 87 | ||
81 | static unsigned long crc; /* shift register contents */ | 88 | /* This is used to sanify any unused bits from the bitbuffer |
89 | * so they arent skipped when reading trailers (trailing headers) */ | ||
90 | unsigned char gunzip_in_buffer_count; | ||
91 | unsigned char *gunzip_in_buffer; | ||
82 | 92 | ||
83 | /* Return codes from gzip */ | 93 | /* gunzip_window size--must be a power of two, and |
84 | #define ERROR 1 | 94 | * at least 32K for zip's deflate method */ |
95 | static const int gunzip_wsize = 0x8000; | ||
85 | 96 | ||
86 | /* | 97 | static unsigned char *gunzip_window; |
87 | * window size--must be a power of two, and | 98 | static unsigned int *gunzip_crc_table; |
88 | * at least 32K for zip's deflate method | 99 | unsigned int gunzip_crc; |
89 | */ | ||
90 | #define WSIZE 0x8000 | ||
91 | 100 | ||
92 | /* If BMAX needs to be larger than 16, then h and x[] should be ulg. */ | 101 | /* If BMAX needs to be larger than 16, then h and x[] should be ulg. */ |
93 | #define BMAX 16 /* maximum bit length of any code (16 for explode) */ | 102 | #define BMAX 16 /* maximum bit length of any code (16 for explode) */ |
94 | #define N_MAX 288 /* maximum number of codes in any set */ | 103 | #define N_MAX 288 /* maximum number of codes in any set */ |
95 | 104 | ||
96 | static long bytes_out; /* number of output bytes */ | 105 | static unsigned int gunzip_hufts; /* track memory usage */ |
97 | static unsigned long outcnt; /* bytes in output buffer */ | 106 | static unsigned int gunzip_bb; /* bit buffer */ |
98 | 107 | static unsigned char gunzip_bk; /* bits in bit buffer */ | |
99 | static unsigned hufts; /* track memory usage */ | ||
100 | static unsigned long bb; /* bit buffer */ | ||
101 | static unsigned bk; /* bits in bit buffer */ | ||
102 | |||
103 | typedef struct huft_s { | ||
104 | unsigned char e; /* number of extra bits or operation */ | ||
105 | unsigned char b; /* number of bits in this code or subcode */ | ||
106 | union { | ||
107 | unsigned short n; /* literal, length base, or distance base */ | ||
108 | struct huft_s *t; /* pointer to next level of table */ | ||
109 | } v; | ||
110 | } huft_t; | ||
111 | 108 | ||
112 | static const unsigned short mask_bits[] = { | 109 | static const unsigned short mask_bits[] = { |
113 | 0x0000, | 110 | 0x0000, 0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff, |
114 | 0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff, | ||
115 | 0x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff | 111 | 0x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff |
116 | }; | 112 | }; |
117 | 113 | ||
118 | /* static int error_number = 0; */ | 114 | /* Copy lengths for literal codes 257..285 */ |
119 | /* ======================================================================== | 115 | static const unsigned short cplens[] = { |
120 | * Signal and error handler. | 116 | 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, |
121 | */ | 117 | 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0 |
118 | }; | ||
119 | |||
120 | /* note: see note #13 above about the 258 in this list. */ | ||
121 | /* Extra bits for literal codes 257..285 */ | ||
122 | static const unsigned char cplext[] = { | ||
123 | 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, | ||
124 | 5, 5, 5, 0, 99, 99 | ||
125 | }; /* 99==invalid */ | ||
126 | |||
127 | /* Copy offsets for distance codes 0..29 */ | ||
128 | static const unsigned short cpdist[] = { | ||
129 | 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, | ||
130 | 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577 | ||
131 | }; | ||
132 | |||
133 | /* Extra bits for distance codes */ | ||
134 | static const unsigned char cpdext[] = { | ||
135 | 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, | ||
136 | 11, 11, 12, 12, 13, 13 | ||
137 | }; | ||
138 | |||
139 | /* Tables for deflate from PKZIP's appnote.txt. */ | ||
140 | /* Order of the bit length code lengths */ | ||
141 | static const unsigned char border[] = { | ||
142 | 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 | ||
143 | }; | ||
144 | |||
145 | static unsigned int fill_bitbuffer(unsigned int bitbuffer, unsigned int *current, const unsigned int required) | ||
146 | { | ||
147 | while (*current < required) { | ||
148 | bitbuffer |= ((unsigned int) xread_char(gunzip_src_fd)) << *current; | ||
149 | *current += 8; | ||
150 | } | ||
151 | |||
152 | return(bitbuffer); | ||
153 | } | ||
122 | 154 | ||
123 | static void abort_gzip(void) | 155 | static void abort_gzip(void) |
124 | { | 156 | { |
125 | error_msg("gzip aborted\n"); | 157 | error_msg("gzip aborted\n"); |
126 | exit(ERROR); | 158 | exit(-1); |
127 | } | 159 | } |
128 | 160 | ||
129 | static void make_crc_table(void) | 161 | static void make_gunzip_crc_table(void) |
130 | { | 162 | { |
131 | const unsigned long poly = 0xedb88320; /* polynomial exclusive-or pattern */ | 163 | const unsigned int poly = 0xedb88320; /* polynomial exclusive-or pattern */ |
132 | unsigned short i; /* counter for all possible eight bit values */ | 164 | unsigned short i; /* counter for all possible eight bit values */ |
133 | 165 | ||
134 | /* initial shift register value */ | 166 | /* initial shift register value */ |
135 | crc = 0xffffffffL; | 167 | gunzip_crc = 0xffffffffL; |
136 | crc_table = (unsigned long *) malloc(256 * sizeof(unsigned long)); | 168 | gunzip_crc_table = (unsigned int *) malloc(256 * sizeof(unsigned int)); |
137 | 169 | ||
138 | /* Compute and print table of CRC's, five per line */ | 170 | /* Compute and print table of CRC's, five per line */ |
139 | for (i = 0; i < 256; i++) { | 171 | for (i = 0; i < 256; i++) { |
140 | unsigned long table_entry; /* crc shift register */ | 172 | unsigned int table_entry; /* crc shift register */ |
141 | char k; /* byte being shifted into crc apparatus */ | 173 | unsigned char k; /* byte being shifted into crc apparatus */ |
142 | 174 | ||
143 | table_entry = i; | 175 | table_entry = i; |
144 | /* The idea to initialize the register with the byte instead of | 176 | /* The idea to initialize the register with the byte instead of |
145 | * zero was stolen from Haruhiko Okumura's ar002 | 177 | * zero was stolen from Haruhiko Okumura's ar002 |
146 | */ | 178 | */ |
147 | for (k = 8; k; k--) { | 179 | for (k = 8; k; k--) { |
148 | table_entry = | 180 | if (table_entry & 1) { |
149 | table_entry & 1 ? (table_entry >> 1) ^ poly : table_entry >> | 181 | table_entry = (table_entry >> 1) ^ poly; |
150 | 1; | 182 | } else { |
151 | } | 183 | table_entry >>= 1; |
152 | crc_table[i] = table_entry; | ||
153 | } | 184 | } |
154 | } | ||
155 | |||
156 | /* =========================================================================== | ||
157 | * Write the output window window[0..outcnt-1] and update crc and bytes_out. | ||
158 | * (Used for the decompressed data only.) | ||
159 | */ | ||
160 | static void flush_window(void) | ||
161 | { | ||
162 | int n; | ||
163 | |||
164 | if (outcnt == 0) | ||
165 | return; | ||
166 | |||
167 | for (n = 0; n < outcnt; n++) { | ||
168 | crc = crc_table[((int) crc ^ (window[n])) & 0xff] ^ (crc >> 8); | ||
169 | } | 185 | } |
170 | 186 | gunzip_crc_table[i] = table_entry; | |
171 | if (fwrite(window, 1, outcnt, out_file) != outcnt) { | ||
172 | error_msg_and_die("Couldnt write"); | ||
173 | } | 187 | } |
174 | bytes_out += (unsigned long) outcnt; | ||
175 | outcnt = 0; | ||
176 | } | 188 | } |
177 | 189 | ||
178 | /* | 190 | /* |
@@ -183,7 +195,8 @@ static void flush_window(void) | |||
183 | */ | 195 | */ |
184 | static int huft_free(huft_t * t) | 196 | static int huft_free(huft_t * t) |
185 | { | 197 | { |
186 | huft_t *p, *q; | 198 | huft_t *p; |
199 | huft_t *q; | ||
187 | 200 | ||
188 | /* Go through linked list, freeing from the malloced (t[-1]) address. */ | 201 | /* Go through linked list, freeing from the malloced (t[-1]) address. */ |
189 | p = t; | 202 | p = t; |
@@ -195,8 +208,6 @@ static int huft_free(huft_t * t) | |||
195 | return 0; | 208 | return 0; |
196 | } | 209 | } |
197 | 210 | ||
198 | typedef unsigned char extra_bits_t; | ||
199 | |||
200 | /* Given a list of code lengths and a maximum table size, make a set of | 211 | /* Given a list of code lengths and a maximum table size, make a set of |
201 | * tables to decode that set of codes. Return zero on success, one if | 212 | * tables to decode that set of codes. Return zero on success, one if |
202 | * the given code set is incomplete (the tables are still built in this | 213 | * the given code set is incomplete (the tables are still built in this |
@@ -213,7 +224,7 @@ typedef unsigned char extra_bits_t; | |||
213 | */ | 224 | */ |
214 | static int huft_build(unsigned int *b, const unsigned int n, | 225 | static int huft_build(unsigned int *b, const unsigned int n, |
215 | const unsigned int s, const unsigned short *d, | 226 | const unsigned int s, const unsigned short *d, |
216 | const extra_bits_t * e, huft_t ** t, int *m) | 227 | const unsigned char *e, huft_t ** t, int *m) |
217 | { | 228 | { |
218 | unsigned a; /* counter for codes of length k */ | 229 | unsigned a; /* counter for codes of length k */ |
219 | unsigned c[BMAX + 1]; /* bit length count table */ | 230 | unsigned c[BMAX + 1]; /* bit length count table */ |
@@ -251,26 +262,35 @@ static int huft_build(unsigned int *b, const unsigned int n, | |||
251 | 262 | ||
252 | /* Find minimum and maximum length, bound *m by those */ | 263 | /* Find minimum and maximum length, bound *m by those */ |
253 | l = *m; | 264 | l = *m; |
254 | for (j = 1; j <= BMAX; j++) | 265 | for (j = 1; j <= BMAX; j++) { |
255 | if (c[j]) | 266 | if (c[j]) { |
256 | break; | 267 | break; |
268 | } | ||
269 | } | ||
257 | k = j; /* minimum code length */ | 270 | k = j; /* minimum code length */ |
258 | if ((unsigned) l < j) | 271 | if ((unsigned) l < j) { |
259 | l = j; | 272 | l = j; |
260 | for (i = BMAX; i; i--) | 273 | } |
261 | if (c[i]) | 274 | for (i = BMAX; i; i--) { |
275 | if (c[i]) { | ||
262 | break; | 276 | break; |
277 | } | ||
278 | } | ||
263 | g = i; /* maximum code length */ | 279 | g = i; /* maximum code length */ |
264 | if ((unsigned) l > i) | 280 | if ((unsigned) l > i) { |
265 | l = i; | 281 | l = i; |
282 | } | ||
266 | *m = l; | 283 | *m = l; |
267 | 284 | ||
268 | /* Adjust last length count to fill out codes, if needed */ | 285 | /* Adjust last length count to fill out codes, if needed */ |
269 | for (y = 1 << j; j < i; j++, y <<= 1) | 286 | for (y = 1 << j; j < i; j++, y <<= 1) { |
270 | if ((y -= c[j]) < 0) | 287 | if ((y -= c[j]) < 0) { |
271 | return 2; /* bad input: more codes than bits */ | 288 | return 2; /* bad input: more codes than bits */ |
272 | if ((y -= c[i]) < 0) | 289 | } |
290 | } | ||
291 | if ((y -= c[i]) < 0) { | ||
273 | return 2; | 292 | return 2; |
293 | } | ||
274 | c[i] += y; | 294 | c[i] += y; |
275 | 295 | ||
276 | /* Generate starting offsets into the value table for each length */ | 296 | /* Generate starting offsets into the value table for each length */ |
@@ -285,8 +305,9 @@ static int huft_build(unsigned int *b, const unsigned int n, | |||
285 | p = b; | 305 | p = b; |
286 | i = 0; | 306 | i = 0; |
287 | do { | 307 | do { |
288 | if ((j = *p++) != 0) | 308 | if ((j = *p++) != 0) { |
289 | v[x[j]++] = i; | 309 | v[x[j]++] = i; |
310 | } | ||
290 | } while (++i < n); | 311 | } while (++i < n); |
291 | 312 | ||
292 | /* Generate the Huffman codes and for each, make the table entries */ | 313 | /* Generate the Huffman codes and for each, make the table entries */ |
@@ -314,8 +335,9 @@ static int huft_build(unsigned int *b, const unsigned int n, | |||
314 | f -= a + 1; /* deduct codes from patterns left */ | 335 | f -= a + 1; /* deduct codes from patterns left */ |
315 | xp = c + k; | 336 | xp = c + k; |
316 | while (++j < z) { /* try smaller tables up to z bits */ | 337 | while (++j < z) { /* try smaller tables up to z bits */ |
317 | if ((f <<= 1) <= *++xp) | 338 | if ((f <<= 1) <= *++xp) { |
318 | break; /* enough codes to use up j bits */ | 339 | break; /* enough codes to use up j bits */ |
340 | } | ||
319 | f -= *xp; /* else deduct codes from patterns */ | 341 | f -= *xp; /* else deduct codes from patterns */ |
320 | } | 342 | } |
321 | } | 343 | } |
@@ -324,7 +346,7 @@ static int huft_build(unsigned int *b, const unsigned int n, | |||
324 | /* allocate and link in new table */ | 346 | /* allocate and link in new table */ |
325 | q = (huft_t *) xmalloc((z + 1) * sizeof(huft_t)); | 347 | q = (huft_t *) xmalloc((z + 1) * sizeof(huft_t)); |
326 | 348 | ||
327 | hufts += z + 1; /* track memory usage */ | 349 | gunzip_hufts += z + 1; /* track memory usage */ |
328 | *t = q + 1; /* link to list for huft_free() */ | 350 | *t = q + 1; /* link to list for huft_free() */ |
329 | *(t = &(q->v.t)) = NULL; | 351 | *(t = &(q->v.t)) = NULL; |
330 | u[h] = ++q; /* table starts after link */ | 352 | u[h] = ++q; /* table starts after link */ |
@@ -342,9 +364,9 @@ static int huft_build(unsigned int *b, const unsigned int n, | |||
342 | 364 | ||
343 | /* set up table entry in r */ | 365 | /* set up table entry in r */ |
344 | r.b = (unsigned char) (k - w); | 366 | r.b = (unsigned char) (k - w); |
345 | if (p >= v + n) | 367 | if (p >= v + n) { |
346 | r.e = 99; /* out of values--invalid code */ | 368 | r.e = 99; /* out of values--invalid code */ |
347 | else if (*p < s) { | 369 | } else if (*p < s) { |
348 | r.e = (unsigned char) (*p < 256 ? 16 : 15); /* 256 is end-of-block code */ | 370 | r.e = (unsigned char) (*p < 256 ? 16 : 15); /* 256 is end-of-block code */ |
349 | r.v.n = (unsigned short) (*p); /* simple code is just the value */ | 371 | r.v.n = (unsigned short) (*p); /* simple code is just the value */ |
350 | p++; /* one compiler does not like *p++ */ | 372 | p++; /* one compiler does not like *p++ */ |
@@ -355,12 +377,14 @@ static int huft_build(unsigned int *b, const unsigned int n, | |||
355 | 377 | ||
356 | /* fill code-like entries with r */ | 378 | /* fill code-like entries with r */ |
357 | f = 1 << (k - w); | 379 | f = 1 << (k - w); |
358 | for (j = i >> w; j < z; j += f) | 380 | for (j = i >> w; j < z; j += f) { |
359 | q[j] = r; | 381 | q[j] = r; |
382 | } | ||
360 | 383 | ||
361 | /* backwards increment the k-bit code i */ | 384 | /* backwards increment the k-bit code i */ |
362 | for (j = 1 << (k - 1); i & j; j >>= 1) | 385 | for (j = 1 << (k - 1); i & j; j >>= 1) { |
363 | i ^= j; | 386 | i ^= j; |
387 | } | ||
364 | i ^= j; | 388 | i ^= j; |
365 | 389 | ||
366 | /* backup over finished tables */ | 390 | /* backup over finished tables */ |
@@ -374,6 +398,25 @@ static int huft_build(unsigned int *b, const unsigned int n, | |||
374 | return y != 0 && g != 1; | 398 | return y != 0 && g != 1; |
375 | } | 399 | } |
376 | 400 | ||
401 | /* =========================================================================== | ||
402 | * Write the output gunzip_window gunzip_window[0..gunzip_outbuf_count-1] and update crc and gunzip_bytes_out. | ||
403 | * (Used for the decompressed data only.) | ||
404 | */ | ||
405 | static void flush_gunzip_window(void) | ||
406 | { | ||
407 | int n; | ||
408 | |||
409 | for (n = 0; n < gunzip_outbuf_count; n++) { | ||
410 | gunzip_crc = gunzip_crc_table[((int) gunzip_crc ^ (gunzip_window[n])) & 0xff] ^ (gunzip_crc >> 8); | ||
411 | } | ||
412 | |||
413 | if (write(gunzip_dst_fd, gunzip_window, gunzip_outbuf_count) != gunzip_outbuf_count) { | ||
414 | error_msg_and_die("Couldnt write"); | ||
415 | } | ||
416 | gunzip_bytes_out += gunzip_outbuf_count; | ||
417 | gunzip_outbuf_count = 0; | ||
418 | } | ||
419 | |||
377 | /* | 420 | /* |
378 | * inflate (decompress) the codes in a deflated (compressed) block. | 421 | * inflate (decompress) the codes in a deflated (compressed) block. |
379 | * Return an error code or zero if it all goes ok. | 422 | * Return an error code or zero if it all goes ok. |
@@ -381,32 +424,26 @@ static int huft_build(unsigned int *b, const unsigned int n, | |||
381 | * tl, td: literal/length and distance decoder tables | 424 | * tl, td: literal/length and distance decoder tables |
382 | * bl, bd: number of bits decoded by tl[] and td[] | 425 | * bl, bd: number of bits decoded by tl[] and td[] |
383 | */ | 426 | */ |
384 | static int inflate_codes(huft_t * tl, huft_t * td, int bl, int bd) | 427 | static int inflate_codes(huft_t * tl, huft_t * td, const unsigned int bl, const unsigned int bd) |
385 | { | 428 | { |
386 | register unsigned long e; /* table entry flag/number of extra bits */ | 429 | unsigned int e; /* table entry flag/number of extra bits */ |
387 | unsigned long n, d; /* length and index for copy */ | 430 | unsigned int n, d; /* length and index for copy */ |
388 | unsigned long w; /* current window position */ | 431 | unsigned int w; /* current gunzip_window position */ |
389 | huft_t *t; /* pointer to table entry */ | 432 | huft_t *t; /* pointer to table entry */ |
390 | unsigned ml, md; /* masks for bl and bd bits */ | 433 | unsigned int ml, md; /* masks for bl and bd bits */ |
391 | register unsigned long b; /* bit buffer */ | 434 | unsigned int b; /* bit buffer */ |
392 | register unsigned k; /* number of bits in bit buffer */ | 435 | unsigned int k; /* number of bits in bit buffer */ |
393 | register int input_char; | ||
394 | 436 | ||
395 | /* make local copies of globals */ | 437 | /* make local copies of globals */ |
396 | b = bb; /* initialize bit buffer */ | 438 | b = gunzip_bb; /* initialize bit buffer */ |
397 | k = bk; | 439 | k = gunzip_bk; |
398 | w = outcnt; /* initialize window position */ | 440 | w = gunzip_outbuf_count; /* initialize gunzip_window position */ |
399 | 441 | ||
400 | /* inflate the coded data */ | 442 | /* inflate the coded data */ |
401 | ml = mask_bits[bl]; /* precompute masks for speed */ | 443 | ml = mask_bits[bl]; /* precompute masks for speed */ |
402 | md = mask_bits[bd]; | 444 | md = mask_bits[bd]; |
403 | for (;;) { /* do until end of block */ | 445 | while (1) { /* do until end of block */ |
404 | while (k < (unsigned) bl) { | 446 | b = fill_bitbuffer(b, &k, bl); |
405 | input_char = fgetc(in_file); | ||
406 | if (input_char == EOF) return 1; | ||
407 | b |= ((unsigned long)input_char) << k; | ||
408 | k += 8; | ||
409 | } | ||
410 | if ((e = (t = tl + ((unsigned) b & ml))->e) > 16) | 447 | if ((e = (t = tl + ((unsigned) b & ml))->e) > 16) |
411 | do { | 448 | do { |
412 | if (e == 99) { | 449 | if (e == 99) { |
@@ -415,20 +452,16 @@ static int inflate_codes(huft_t * tl, huft_t * td, int bl, int bd) | |||
415 | b >>= t->b; | 452 | b >>= t->b; |
416 | k -= t->b; | 453 | k -= t->b; |
417 | e -= 16; | 454 | e -= 16; |
418 | while (k < e) { | 455 | b = fill_bitbuffer(b, &k, e); |
419 | input_char = fgetc(in_file); | ||
420 | if (input_char == EOF) return 1; | ||
421 | b |= ((unsigned long)input_char) << k; | ||
422 | k += 8; | ||
423 | } | ||
424 | } while ((e = | 456 | } while ((e = |
425 | (t = t->v.t + ((unsigned) b & mask_bits[e]))->e) > 16); | 457 | (t = t->v.t + ((unsigned) b & mask_bits[e]))->e) > 16); |
426 | b >>= t->b; | 458 | b >>= t->b; |
427 | k -= t->b; | 459 | k -= t->b; |
428 | if (e == 16) { /* then it's a literal */ | 460 | if (e == 16) { /* then it's a literal */ |
429 | window[w++] = (unsigned char) t->v.n; | 461 | gunzip_window[w++] = (unsigned char) t->v.n; |
430 | if (w == WSIZE) { | 462 | if (w == gunzip_wsize) { |
431 | outcnt = (w), flush_window(); | 463 | gunzip_outbuf_count = (w); |
464 | flush_gunzip_window(); | ||
432 | w = 0; | 465 | w = 0; |
433 | } | 466 | } |
434 | } else { /* it's an EOB or a length */ | 467 | } else { /* it's an EOB or a length */ |
@@ -439,24 +472,13 @@ static int inflate_codes(huft_t * tl, huft_t * td, int bl, int bd) | |||
439 | } | 472 | } |
440 | 473 | ||
441 | /* get length of block to copy */ | 474 | /* get length of block to copy */ |
442 | while (k < e) { | 475 | b = fill_bitbuffer(b, &k, e); |
443 | input_char = fgetc(in_file); | ||
444 | if (input_char == EOF) return 1; | ||
445 | b |= ((unsigned long)input_char) << k; | ||
446 | k += 8; | ||
447 | } | ||
448 | n = t->v.n + ((unsigned) b & mask_bits[e]); | 476 | n = t->v.n + ((unsigned) b & mask_bits[e]); |
449 | b >>= e; | 477 | b >>= e; |
450 | k -= e; | 478 | k -= e; |
451 | 479 | ||
452 | /* decode distance of block to copy */ | 480 | /* decode distance of block to copy */ |
453 | while (k < (unsigned) bd) { | 481 | b = fill_bitbuffer(b, &k, bd); |
454 | input_char = fgetc(in_file); | ||
455 | if (input_char == EOF) return 1; | ||
456 | b |= ((unsigned long)input_char) << k; | ||
457 | k += 8; | ||
458 | } | ||
459 | |||
460 | if ((e = (t = td + ((unsigned) b & md))->e) > 16) | 482 | if ((e = (t = td + ((unsigned) b & md))->e) > 16) |
461 | do { | 483 | do { |
462 | if (e == 99) | 484 | if (e == 99) |
@@ -464,23 +486,13 @@ static int inflate_codes(huft_t * tl, huft_t * td, int bl, int bd) | |||
464 | b >>= t->b; | 486 | b >>= t->b; |
465 | k -= t->b; | 487 | k -= t->b; |
466 | e -= 16; | 488 | e -= 16; |
467 | while (k < e) { | 489 | b = fill_bitbuffer(b, &k, e); |
468 | input_char = fgetc(in_file); | ||
469 | if (input_char == EOF) return 1; | ||
470 | b |= ((unsigned long)input_char) << k; | ||
471 | k += 8; | ||
472 | } | ||
473 | } while ((e = | 490 | } while ((e = |
474 | (t = | 491 | (t = |
475 | t->v.t + ((unsigned) b & mask_bits[e]))->e) > 16); | 492 | t->v.t + ((unsigned) b & mask_bits[e]))->e) > 16); |
476 | b >>= t->b; | 493 | b >>= t->b; |
477 | k -= t->b; | 494 | k -= t->b; |
478 | while (k < e) { | 495 | b = fill_bitbuffer(b, &k, e); |
479 | input_char = fgetc(in_file); | ||
480 | if (input_char == EOF) return 1; | ||
481 | b |= ((unsigned long)input_char) << k; | ||
482 | k += 8; | ||
483 | } | ||
484 | d = w - t->v.n - ((unsigned) b & mask_bits[e]); | 496 | d = w - t->v.n - ((unsigned) b & mask_bits[e]); |
485 | b >>= e; | 497 | b >>= e; |
486 | k -= e; | 498 | k -= e; |
@@ -489,60 +501,38 @@ static int inflate_codes(huft_t * tl, huft_t * td, int bl, int bd) | |||
489 | do { | 501 | do { |
490 | n -= (e = | 502 | n -= (e = |
491 | (e = | 503 | (e = |
492 | WSIZE - ((d &= WSIZE - 1) > w ? d : w)) > n ? n : e); | 504 | gunzip_wsize - ((d &= gunzip_wsize - 1) > w ? d : w)) > n ? n : e); |
493 | #if !defined(NOMEMCPY) && !defined(DEBUG) | 505 | /* copy to new buffer to prevent possible overwrite */ |
494 | if (w - d >= e) { /* (this test assumes unsigned comparison) */ | 506 | if (w - d >= e) { /* (this test assumes unsigned comparison) */ |
495 | memcpy(window + w, window + d, e); | 507 | memcpy(gunzip_window + w, gunzip_window + d, e); |
496 | w += e; | 508 | w += e; |
497 | d += e; | 509 | d += e; |
498 | } else /* do it slow to avoid memcpy() overlap */ | 510 | } else { |
499 | #endif /* !NOMEMCPY */ | 511 | /* do it slow to avoid memcpy() overlap */ |
512 | /* !NOMEMCPY */ | ||
500 | do { | 513 | do { |
501 | window[w++] = window[d++]; | 514 | gunzip_window[w++] = gunzip_window[d++]; |
502 | } while (--e); | 515 | } while (--e); |
503 | if (w == WSIZE) { | 516 | } |
504 | outcnt = (w), flush_window(); | 517 | if (w == gunzip_wsize) { |
518 | gunzip_outbuf_count = (w); | ||
519 | flush_gunzip_window(); | ||
505 | w = 0; | 520 | w = 0; |
506 | } | 521 | } |
522 | |||
507 | } while (n); | 523 | } while (n); |
508 | } | 524 | } |
509 | } | 525 | } |
510 | 526 | ||
511 | /* restore the globals from the locals */ | 527 | /* restore the globals from the locals */ |
512 | outcnt = w; /* restore global window pointer */ | 528 | gunzip_outbuf_count = w; /* restore global gunzip_window pointer */ |
513 | bb = b; /* restore global bit buffer */ | 529 | gunzip_bb = b; /* restore global bit buffer */ |
514 | bk = k; | 530 | gunzip_bk = k; |
515 | 531 | ||
516 | /* done */ | 532 | /* done */ |
517 | return 0; | 533 | return 0; |
518 | } | 534 | } |
519 | 535 | ||
520 | static const unsigned short cplens[] = { /* Copy lengths for literal codes 257..285 */ | ||
521 | 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, | ||
522 | 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0 | ||
523 | }; | ||
524 | |||
525 | /* note: see note #13 above about the 258 in this list. */ | ||
526 | static const extra_bits_t cplext[] = { /* Extra bits for literal codes 257..285 */ | ||
527 | 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, | ||
528 | 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 99, 99 | ||
529 | }; /* 99==invalid */ | ||
530 | static const unsigned short cpdist[] = { /* Copy offsets for distance codes 0..29 */ | ||
531 | 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, | ||
532 | 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, | ||
533 | 8193, 12289, 16385, 24577 | ||
534 | }; | ||
535 | static const extra_bits_t cpdext[] = { /* Extra bits for distance codes */ | ||
536 | 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, | ||
537 | 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, | ||
538 | 12, 12, 13, 13 | ||
539 | }; | ||
540 | |||
541 | /* Tables for deflate from PKZIP's appnote.txt. */ | ||
542 | static const extra_bits_t border[] = { /* Order of the bit length code lengths */ | ||
543 | 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 | ||
544 | }; | ||
545 | |||
546 | /* | 536 | /* |
547 | * decompress an inflated block | 537 | * decompress an inflated block |
548 | * e: last block flag | 538 | * e: last block flag |
@@ -552,53 +542,43 @@ static const extra_bits_t border[] = { /* Order of the bit length code lengths * | |||
552 | static int inflate_block(int *e) | 542 | static int inflate_block(int *e) |
553 | { | 543 | { |
554 | unsigned t; /* block type */ | 544 | unsigned t; /* block type */ |
555 | register unsigned long b; /* bit buffer */ | 545 | register unsigned int b; /* bit buffer */ |
556 | register unsigned k; /* number of bits in bit buffer */ | 546 | unsigned int k; /* number of bits in bit buffer */ |
557 | int input_char; | ||
558 | 547 | ||
559 | /* make local bit buffer */ | 548 | /* make local bit buffer */ |
560 | b = bb; | 549 | |
561 | k = bk; | 550 | b = gunzip_bb; |
551 | k = gunzip_bk; | ||
562 | 552 | ||
563 | /* read in last block bit */ | 553 | /* read in last block bit */ |
564 | while (k < 1) { | 554 | b = fill_bitbuffer(b, &k, 1); |
565 | input_char = fgetc(in_file); | ||
566 | if (input_char == EOF) return 1; | ||
567 | b |= ((unsigned long)input_char) << k; | ||
568 | k += 8; | ||
569 | } | ||
570 | *e = (int) b & 1; | 555 | *e = (int) b & 1; |
571 | b >>= 1; | 556 | b >>= 1; |
572 | k -= 1; | 557 | k -= 1; |
573 | 558 | ||
574 | /* read in block type */ | 559 | /* read in block type */ |
575 | while (k < 2) { | 560 | b = fill_bitbuffer(b, &k, 2); |
576 | input_char = fgetc(in_file); | ||
577 | if (input_char == EOF) return 1; | ||
578 | b |= ((unsigned long)input_char) << k; | ||
579 | k += 8; | ||
580 | } | ||
581 | t = (unsigned) b & 3; | 561 | t = (unsigned) b & 3; |
582 | b >>= 2; | 562 | b >>= 2; |
583 | k -= 2; | 563 | k -= 2; |
584 | 564 | ||
585 | /* restore the global bit buffer */ | 565 | /* restore the global bit buffer */ |
586 | bb = b; | 566 | gunzip_bb = b; |
587 | bk = k; | 567 | gunzip_bk = k; |
588 | 568 | ||
589 | /* inflate that block type */ | 569 | /* inflate that block type */ |
590 | switch (t) { | 570 | switch (t) { |
591 | case 0: /* Inflate stored */ | 571 | case 0: /* Inflate stored */ |
592 | { | 572 | { |
593 | unsigned long n; /* number of bytes in block */ | 573 | unsigned int n; /* number of bytes in block */ |
594 | unsigned long w; /* current window position */ | 574 | unsigned int w; /* current gunzip_window position */ |
595 | register unsigned long b_stored; /* bit buffer */ | 575 | unsigned int b_stored; /* bit buffer */ |
596 | register unsigned long k_stored; /* number of bits in bit buffer */ | 576 | unsigned int k_stored; /* number of bits in bit buffer */ |
597 | 577 | ||
598 | /* make local copies of globals */ | 578 | /* make local copies of globals */ |
599 | b_stored = bb; /* initialize bit buffer */ | 579 | b_stored = gunzip_bb; /* initialize bit buffer */ |
600 | k_stored = bk; | 580 | k_stored = gunzip_bk; |
601 | w = outcnt; /* initialize window position */ | 581 | w = gunzip_outbuf_count; /* initialize gunzip_window position */ |
602 | 582 | ||
603 | /* go to byte boundary */ | 583 | /* go to byte boundary */ |
604 | n = k_stored & 7; | 584 | n = k_stored & 7; |
@@ -606,21 +586,12 @@ static int inflate_block(int *e) | |||
606 | k_stored -= n; | 586 | k_stored -= n; |
607 | 587 | ||
608 | /* get the length and its complement */ | 588 | /* get the length and its complement */ |
609 | while (k_stored < 16) { | 589 | b_stored = fill_bitbuffer(b_stored, &k_stored, 16); |
610 | input_char = fgetc(in_file); | ||
611 | if (input_char == EOF) return 1; | ||
612 | b_stored |= ((unsigned long)input_char) << k_stored; | ||
613 | k_stored += 8; | ||
614 | } | ||
615 | n = ((unsigned) b_stored & 0xffff); | 590 | n = ((unsigned) b_stored & 0xffff); |
616 | b_stored >>= 16; | 591 | b_stored >>= 16; |
617 | k_stored -= 16; | 592 | k_stored -= 16; |
618 | while (k_stored < 16) { | 593 | |
619 | input_char = fgetc(in_file); | 594 | b_stored = fill_bitbuffer(b_stored, &k_stored, 16); |
620 | if (input_char == EOF) return 1; | ||
621 | b_stored |= ((unsigned long)input_char) << k_stored; | ||
622 | k_stored += 8; | ||
623 | } | ||
624 | if (n != (unsigned) ((~b_stored) & 0xffff)) { | 595 | if (n != (unsigned) ((~b_stored) & 0xffff)) { |
625 | return 1; /* error in compressed data */ | 596 | return 1; /* error in compressed data */ |
626 | } | 597 | } |
@@ -629,15 +600,11 @@ static int inflate_block(int *e) | |||
629 | 600 | ||
630 | /* read and output the compressed data */ | 601 | /* read and output the compressed data */ |
631 | while (n--) { | 602 | while (n--) { |
632 | while (k_stored < 8) { | 603 | b_stored = fill_bitbuffer(b_stored, &k_stored, 8); |
633 | input_char = fgetc(in_file); | 604 | gunzip_window[w++] = (unsigned char) b_stored; |
634 | if (input_char == EOF) return 1; | 605 | if (w == (unsigned int) gunzip_wsize) { |
635 | b_stored |= ((unsigned long)input_char) << k_stored; | 606 | gunzip_outbuf_count = (w); |
636 | k_stored += 8; | 607 | flush_gunzip_window(); |
637 | } | ||
638 | window[w++] = (unsigned char) b_stored; | ||
639 | if (w == (unsigned long) WSIZE) { | ||
640 | outcnt = (w), flush_window(); | ||
641 | w = 0; | 608 | w = 0; |
642 | } | 609 | } |
643 | b_stored >>= 8; | 610 | b_stored >>= 8; |
@@ -645,9 +612,9 @@ static int inflate_block(int *e) | |||
645 | } | 612 | } |
646 | 613 | ||
647 | /* restore the globals from the locals */ | 614 | /* restore the globals from the locals */ |
648 | outcnt = w; /* restore global window pointer */ | 615 | gunzip_outbuf_count = w; /* restore global gunzip_window pointer */ |
649 | bb = b_stored; /* restore global bit buffer */ | 616 | gunzip_bb = b_stored; /* restore global bit buffer */ |
650 | bk = k_stored; | 617 | gunzip_bk = k_stored; |
651 | return 0; | 618 | return 0; |
652 | } | 619 | } |
653 | case 1: /* Inflate fixed | 620 | case 1: /* Inflate fixed |
@@ -659,8 +626,8 @@ static int inflate_block(int *e) | |||
659 | int i; /* temporary variable */ | 626 | int i; /* temporary variable */ |
660 | huft_t *tl; /* literal/length code table */ | 627 | huft_t *tl; /* literal/length code table */ |
661 | huft_t *td; /* distance code table */ | 628 | huft_t *td; /* distance code table */ |
662 | int bl; /* lookup bits for tl */ | 629 | unsigned int bl; /* lookup bits for tl */ |
663 | int bd; /* lookup bits for td */ | 630 | unsigned int bd; /* lookup bits for td */ |
664 | unsigned int l[288]; /* length list for huft_build */ | 631 | unsigned int l[288]; /* length list for huft_build */ |
665 | 632 | ||
666 | /* set up literal table */ | 633 | /* set up literal table */ |
@@ -692,8 +659,9 @@ static int inflate_block(int *e) | |||
692 | } | 659 | } |
693 | 660 | ||
694 | /* decompress until an end-of-block code */ | 661 | /* decompress until an end-of-block code */ |
695 | if (inflate_codes(tl, td, bl, bd)) | 662 | if (inflate_codes(tl, td, bl, bd)) { |
696 | return 1; | 663 | return 1; |
664 | } | ||
697 | 665 | ||
698 | /* free the decoding tables, return */ | 666 | /* free the decoding tables, return */ |
699 | huft_free(tl); | 667 | huft_free(tl); |
@@ -705,53 +673,41 @@ static int inflate_block(int *e) | |||
705 | const int dbits = 6; /* bits in base distance lookup table */ | 673 | const int dbits = 6; /* bits in base distance lookup table */ |
706 | const int lbits = 9; /* bits in base literal/length lookup table */ | 674 | const int lbits = 9; /* bits in base literal/length lookup table */ |
707 | 675 | ||
708 | int i; /* temporary variables */ | ||
709 | unsigned j; | ||
710 | unsigned l; /* last length */ | ||
711 | unsigned m; /* mask for bit lengths table */ | ||
712 | unsigned n; /* number of lengths to get */ | ||
713 | huft_t *tl; /* literal/length code table */ | 676 | huft_t *tl; /* literal/length code table */ |
714 | huft_t *td; /* distance code table */ | 677 | huft_t *td; /* distance code table */ |
715 | int bl; /* lookup bits for tl */ | 678 | unsigned int i; /* temporary variables */ |
716 | int bd; /* lookup bits for td */ | 679 | unsigned int j; |
717 | unsigned nb; /* number of bit length codes */ | 680 | unsigned int l; /* last length */ |
718 | unsigned nl; /* number of literal/length codes */ | 681 | unsigned int m; /* mask for bit lengths table */ |
719 | unsigned nd; /* number of distance codes */ | 682 | unsigned int n; /* number of lengths to get */ |
720 | 683 | unsigned int bl; /* lookup bits for tl */ | |
721 | unsigned ll[286 + 30]; /* literal/length and distance code lengths */ | 684 | unsigned int bd; /* lookup bits for td */ |
722 | register unsigned long b_dynamic; /* bit buffer */ | 685 | unsigned int nb; /* number of bit length codes */ |
723 | register unsigned k_dynamic; /* number of bits in bit buffer */ | 686 | unsigned int nl; /* number of literal/length codes */ |
687 | unsigned int nd; /* number of distance codes */ | ||
688 | |||
689 | unsigned int ll[286 + 30]; /* literal/length and distance code lengths */ | ||
690 | unsigned int b_dynamic; /* bit buffer */ | ||
691 | unsigned int k_dynamic; /* number of bits in bit buffer */ | ||
724 | 692 | ||
725 | /* make local bit buffer */ | 693 | /* make local bit buffer */ |
726 | b_dynamic = bb; | 694 | b_dynamic = gunzip_bb; |
727 | k_dynamic = bk; | 695 | k_dynamic = gunzip_bk; |
728 | 696 | ||
729 | /* read in table lengths */ | 697 | /* read in table lengths */ |
730 | while (k_dynamic < 5) { | 698 | b_dynamic = fill_bitbuffer(b_dynamic, &k_dynamic, 5); |
731 | input_char = fgetc(in_file); | 699 | nl = 257 + ((unsigned int) b_dynamic & 0x1f); /* number of literal/length codes */ |
732 | if (input_char == EOF) return 1; | 700 | |
733 | b_dynamic |= ((unsigned long)input_char) << k_dynamic; | ||
734 | k_dynamic += 8; | ||
735 | } | ||
736 | nl = 257 + ((unsigned) b_dynamic & 0x1f); /* number of literal/length codes */ | ||
737 | b_dynamic >>= 5; | 701 | b_dynamic >>= 5; |
738 | k_dynamic -= 5; | 702 | k_dynamic -= 5; |
739 | while (k_dynamic < 5) { | 703 | b_dynamic = fill_bitbuffer(b_dynamic, &k_dynamic, 5); |
740 | input_char = fgetc(in_file); | 704 | nd = 1 + ((unsigned int) b_dynamic & 0x1f); /* number of distance codes */ |
741 | if (input_char == EOF) return 1; | 705 | |
742 | b_dynamic |= ((unsigned long)input_char) << k_dynamic; | ||
743 | k_dynamic += 8; | ||
744 | } | ||
745 | nd = 1 + ((unsigned) b_dynamic & 0x1f); /* number of distance codes */ | ||
746 | b_dynamic >>= 5; | 706 | b_dynamic >>= 5; |
747 | k_dynamic -= 5; | 707 | k_dynamic -= 5; |
748 | while (k_dynamic < 4) { | 708 | b_dynamic = fill_bitbuffer(b_dynamic, &k_dynamic, 4); |
749 | input_char = fgetc(in_file); | 709 | nb = 4 + ((unsigned int) b_dynamic & 0xf); /* number of bit length codes */ |
750 | if (input_char == EOF) return 1; | 710 | |
751 | b_dynamic |= ((unsigned long)input_char) << k_dynamic; | ||
752 | k_dynamic += 8; | ||
753 | } | ||
754 | nb = 4 + ((unsigned) b_dynamic & 0xf); /* number of bit length codes */ | ||
755 | b_dynamic >>= 4; | 711 | b_dynamic >>= 4; |
756 | k_dynamic -= 4; | 712 | k_dynamic -= 4; |
757 | if (nl > 286 || nd > 30) { | 713 | if (nl > 286 || nd > 30) { |
@@ -760,13 +716,8 @@ static int inflate_block(int *e) | |||
760 | 716 | ||
761 | /* read in bit-length-code lengths */ | 717 | /* read in bit-length-code lengths */ |
762 | for (j = 0; j < nb; j++) { | 718 | for (j = 0; j < nb; j++) { |
763 | while (k_dynamic < 3) { | 719 | b_dynamic = fill_bitbuffer(b_dynamic, &k_dynamic, 3); |
764 | input_char = fgetc(in_file); | 720 | ll[border[j]] = (unsigned int) b_dynamic & 7; |
765 | if (input_char == EOF) return 1; | ||
766 | b_dynamic |= ((unsigned long)input_char) << k_dynamic; | ||
767 | k_dynamic += 8; | ||
768 | } | ||
769 | ll[border[j]] = (unsigned) b_dynamic & 7; | ||
770 | b_dynamic >>= 3; | 721 | b_dynamic >>= 3; |
771 | k_dynamic -= 3; | 722 | k_dynamic -= 3; |
772 | } | 723 | } |
@@ -776,7 +727,8 @@ static int inflate_block(int *e) | |||
776 | 727 | ||
777 | /* build decoding table for trees--single level, 7 bit lookup */ | 728 | /* build decoding table for trees--single level, 7 bit lookup */ |
778 | bl = 7; | 729 | bl = 7; |
779 | if ((i = huft_build(ll, 19, 19, NULL, NULL, &tl, &bl)) != 0) { | 730 | i = huft_build(ll, 19, 19, NULL, NULL, &tl, &bl); |
731 | if (i != 0) { | ||
780 | if (i == 1) { | 732 | if (i == 1) { |
781 | huft_free(tl); | 733 | huft_free(tl); |
782 | } | 734 | } |
@@ -787,46 +739,31 @@ static int inflate_block(int *e) | |||
787 | n = nl + nd; | 739 | n = nl + nd; |
788 | m = mask_bits[bl]; | 740 | m = mask_bits[bl]; |
789 | i = l = 0; | 741 | i = l = 0; |
790 | while ((unsigned) i < n) { | 742 | while ((unsigned int) i < n) { |
791 | while (k_dynamic < (unsigned) bl) { | 743 | b_dynamic = fill_bitbuffer(b_dynamic, &k_dynamic, (unsigned int)bl); |
792 | input_char = fgetc(in_file); | 744 | j = (td = tl + ((unsigned int) b_dynamic & m))->b; |
793 | if (input_char == EOF) return 1; | ||
794 | b_dynamic |= ((unsigned long)input_char) << k_dynamic; | ||
795 | k_dynamic += 8; | ||
796 | } | ||
797 | j = (td = tl + ((unsigned) b_dynamic & m))->b; | ||
798 | b_dynamic >>= j; | 745 | b_dynamic >>= j; |
799 | k_dynamic -= j; | 746 | k_dynamic -= j; |
800 | j = td->v.n; | 747 | j = td->v.n; |
801 | if (j < 16) { /* length of code in bits (0..15) */ | 748 | if (j < 16) { /* length of code in bits (0..15) */ |
802 | ll[i++] = l = j; /* save last length in l */ | 749 | ll[i++] = l = j; /* save last length in l */ |
803 | } else if (j == 16) { /* repeat last length 3 to 6 times */ | 750 | } else if (j == 16) { /* repeat last length 3 to 6 times */ |
804 | while (k_dynamic < 2) { | 751 | b_dynamic = fill_bitbuffer(b_dynamic, &k_dynamic, 2); |
805 | input_char = fgetc(in_file); | 752 | j = 3 + ((unsigned int) b_dynamic & 3); |
806 | if (input_char == EOF) return 1; | ||
807 | b_dynamic |= ((unsigned long)input_char) << k_dynamic; | ||
808 | k_dynamic += 8; | ||
809 | } | ||
810 | j = 3 + ((unsigned) b_dynamic & 3); | ||
811 | b_dynamic >>= 2; | 753 | b_dynamic >>= 2; |
812 | k_dynamic -= 2; | 754 | k_dynamic -= 2; |
813 | if ((unsigned) i + j > n) { | 755 | if ((unsigned int) i + j > n) { |
814 | return 1; | 756 | return 1; |
815 | } | 757 | } |
816 | while (j--) { | 758 | while (j--) { |
817 | ll[i++] = l; | 759 | ll[i++] = l; |
818 | } | 760 | } |
819 | } else if (j == 17) { /* 3 to 10 zero length codes */ | 761 | } else if (j == 17) { /* 3 to 10 zero length codes */ |
820 | while (k_dynamic < 3) { | 762 | b_dynamic = fill_bitbuffer(b_dynamic, &k_dynamic, 3); |
821 | input_char = fgetc(in_file); | 763 | j = 3 + ((unsigned int) b_dynamic & 7); |
822 | if (input_char == EOF) return 1; | ||
823 | b_dynamic |= ((unsigned long)input_char) << k_dynamic; | ||
824 | k_dynamic += 8; | ||
825 | } | ||
826 | j = 3 + ((unsigned) b_dynamic & 7); | ||
827 | b_dynamic >>= 3; | 764 | b_dynamic >>= 3; |
828 | k_dynamic -= 3; | 765 | k_dynamic -= 3; |
829 | if ((unsigned) i + j > n) { | 766 | if ((unsigned int) i + j > n) { |
830 | return 1; | 767 | return 1; |
831 | } | 768 | } |
832 | while (j--) { | 769 | while (j--) { |
@@ -834,16 +771,11 @@ static int inflate_block(int *e) | |||
834 | } | 771 | } |
835 | l = 0; | 772 | l = 0; |
836 | } else { /* j == 18: 11 to 138 zero length codes */ | 773 | } else { /* j == 18: 11 to 138 zero length codes */ |
837 | while (k_dynamic < 7) { | 774 | b_dynamic = fill_bitbuffer(b_dynamic, &k_dynamic, 7); |
838 | input_char = fgetc(in_file); | 775 | j = 11 + ((unsigned int) b_dynamic & 0x7f); |
839 | if (input_char == EOF) return 1; | ||
840 | b_dynamic |= ((unsigned long)input_char) << k_dynamic; | ||
841 | k_dynamic += 8; | ||
842 | } | ||
843 | j = 11 + ((unsigned) b_dynamic & 0x7f); | ||
844 | b_dynamic >>= 7; | 776 | b_dynamic >>= 7; |
845 | k_dynamic -= 7; | 777 | k_dynamic -= 7; |
846 | if ((unsigned) i + j > n) { | 778 | if ((unsigned int) i + j > n) { |
847 | return 1; | 779 | return 1; |
848 | } | 780 | } |
849 | while (j--) { | 781 | while (j--) { |
@@ -857,22 +789,24 @@ static int inflate_block(int *e) | |||
857 | huft_free(tl); | 789 | huft_free(tl); |
858 | 790 | ||
859 | /* restore the global bit buffer */ | 791 | /* restore the global bit buffer */ |
860 | bb = b_dynamic; | 792 | gunzip_bb = b_dynamic; |
861 | bk = k_dynamic; | 793 | gunzip_bk = k_dynamic; |
862 | 794 | ||
863 | /* build the decoding tables for literal/length and distance codes */ | 795 | /* build the decoding tables for literal/length and distance codes */ |
864 | bl = lbits; | 796 | bl = lbits; |
797 | |||
865 | if ((i = huft_build(ll, nl, 257, cplens, cplext, &tl, &bl)) != 0) { | 798 | if ((i = huft_build(ll, nl, 257, cplens, cplext, &tl, &bl)) != 0) { |
866 | if (i == 1) { | 799 | if (i == 1) { |
867 | error_msg("Incomplete literal tree"); | 800 | error_msg_and_die("Incomplete literal tree"); |
868 | huft_free(tl); | 801 | huft_free(tl); |
869 | } | 802 | } |
870 | return i; /* incomplete code set */ | 803 | return i; /* incomplete code set */ |
871 | } | 804 | } |
805 | |||
872 | bd = dbits; | 806 | bd = dbits; |
873 | if ((i = huft_build(ll + nl, nd, 0, cpdist, cpdext, &td, &bd)) != 0) { | 807 | if ((i = huft_build(ll + nl, nd, 0, cpdist, cpdext, &td, &bd)) != 0) { |
874 | if (i == 1) { | 808 | if (i == 1) { |
875 | error_msg("incomplete distance tree"); | 809 | error_msg_and_die("incomplete distance tree"); |
876 | huft_free(td); | 810 | huft_free(td); |
877 | } | 811 | } |
878 | huft_free(tl); | 812 | huft_free(tl); |
@@ -880,8 +814,9 @@ static int inflate_block(int *e) | |||
880 | } | 814 | } |
881 | 815 | ||
882 | /* decompress until an end-of-block code */ | 816 | /* decompress until an end-of-block code */ |
883 | if (inflate_codes(tl, td, bl, bd)) | 817 | if (inflate_codes(tl, td, bl, bd)) { |
884 | return 1; | 818 | return 1; |
819 | } | ||
885 | 820 | ||
886 | /* free the decoding tables, return */ | 821 | /* free the decoding tables, return */ |
887 | huft_free(tl); | 822 | huft_free(tl); |
@@ -890,6 +825,7 @@ static int inflate_block(int *e) | |||
890 | } | 825 | } |
891 | default: | 826 | default: |
892 | /* bad block type */ | 827 | /* bad block type */ |
828 | error_msg("bad block type %d\n", t); | ||
893 | return 2; | 829 | return 2; |
894 | } | 830 | } |
895 | } | 831 | } |
@@ -897,72 +833,24 @@ static int inflate_block(int *e) | |||
897 | /* | 833 | /* |
898 | * decompress an inflated entry | 834 | * decompress an inflated entry |
899 | * | 835 | * |
900 | * GLOBAL VARIABLES: outcnt, bk, bb, hufts, inptr | 836 | * GLOBAL VARIABLES: gunzip_outbuf_count, bk, gunzip_bb, hufts, inptr |
901 | */ | 837 | */ |
902 | extern int inflate(FILE * in, FILE * out) | 838 | extern int inflate(int in, int out) |
903 | { | 839 | { |
840 | typedef void (*sig_type) (int); | ||
904 | int e; /* last block flag */ | 841 | int e; /* last block flag */ |
905 | int r; /* result code */ | 842 | int r; /* result code */ |
906 | unsigned h = 0; /* maximum struct huft's malloc'ed */ | 843 | unsigned h = 0; /* maximum struct huft's malloc'ed */ |
907 | 844 | ||
908 | /* initialize window, bit buffer */ | ||
909 | outcnt = 0; | ||
910 | bk = 0; | ||
911 | bb = 0; | ||
912 | |||
913 | in_file = in; | ||
914 | out_file = out; | ||
915 | |||
916 | /* Allocate all global buffers (for DYN_ALLOC option) */ | 845 | /* Allocate all global buffers (for DYN_ALLOC option) */ |
917 | window = xmalloc((size_t) (((2L * WSIZE) + 1L) * sizeof(unsigned char))); | 846 | gunzip_window = xmalloc(0x8000); |
918 | bytes_out = 0L; | 847 | gunzip_outbuf_count = 0; |
848 | gunzip_bytes_out = 0; | ||
919 | 849 | ||
920 | /* Create the crc table */ | 850 | gunzip_src_fd = in; |
921 | make_crc_table(); | 851 | gunzip_dst_fd = out; |
922 | 852 | ||
923 | /* decompress until the last block */ | 853 | gunzip_in_buffer = malloc(8); |
924 | do { | ||
925 | hufts = 0; | ||
926 | if ((r = inflate_block(&e)) != 0) { | ||
927 | return r; | ||
928 | } | ||
929 | if (hufts > h) { | ||
930 | h = hufts; | ||
931 | } | ||
932 | } while (!e); | ||
933 | |||
934 | /* Undo too much lookahead. The next read will be byte aligned so we | ||
935 | * can discard unused bits in the last meaningful byte. | ||
936 | */ | ||
937 | while (bk >= 8) { | ||
938 | bk -= 8; | ||
939 | ungetc((bb << bk), in_file); | ||
940 | } | ||
941 | |||
942 | /* flush out window */ | ||
943 | flush_window(); | ||
944 | free(window); | ||
945 | free(crc_table); | ||
946 | |||
947 | /* return success */ | ||
948 | return 0; | ||
949 | } | ||
950 | |||
951 | /* =========================================================================== | ||
952 | * Unzip in to out. This routine works on gzip files only. | ||
953 | * | ||
954 | * IN assertions: the buffer inbuf contains already the beginning of | ||
955 | * the compressed data, from offsets inptr to insize-1 included. | ||
956 | * The magic header has already been checked. The output buffer is cleared. | ||
957 | * in, out: input and output file descriptors | ||
958 | */ | ||
959 | extern int unzip(FILE * l_in_file, FILE * l_out_file) | ||
960 | { | ||
961 | unsigned char buf[8]; /* extended local header */ | ||
962 | unsigned char flags; /* compression flags */ | ||
963 | typedef void (*sig_type) (int); | ||
964 | unsigned short i; | ||
965 | unsigned char magic[2]; | ||
966 | 854 | ||
967 | if (signal(SIGINT, SIG_IGN) != SIG_IGN) { | 855 | if (signal(SIGINT, SIG_IGN) != SIG_IGN) { |
968 | (void) signal(SIGINT, (sig_type) abort_gzip); | 856 | (void) signal(SIGINT, (sig_type) abort_gzip); |
@@ -973,97 +861,44 @@ extern int unzip(FILE * l_in_file, FILE * l_out_file) | |||
973 | } | 861 | } |
974 | #endif | 862 | #endif |
975 | 863 | ||
976 | magic[0] = fgetc(l_in_file); | 864 | /* initialize gunzip_window, bit buffer */ |
977 | magic[1] = fgetc(l_in_file); | 865 | gunzip_bk = 0; |
978 | 866 | gunzip_bb = 0; | |
979 | #ifdef CONFIG_FEATURE_UNCOMPRESS | ||
980 | /* Magic header for compress files, 1F 9d = \037\235 */ | ||
981 | if ((magic[0] == 0x1F) && (magic[1] == 0x9d)) { | ||
982 | return uncompress(l_in_file, l_out_file); | ||
983 | } | ||
984 | #endif | ||
985 | |||
986 | /* Magic header for gzip files, 1F 8B = \037\213 */ | ||
987 | if ((magic[0] != 0x1F) || (magic[1] != 0x8b)) { | ||
988 | error_msg("Invalid gzip magic"); | ||
989 | return EXIT_FAILURE; | ||
990 | } | ||
991 | |||
992 | /* Check the compression method */ | ||
993 | if (fgetc(l_in_file) != 8) /* also catches EOF */ { | ||
994 | error_msg("Unknown compression method"); | ||
995 | return (-1); | ||
996 | } | ||
997 | |||
998 | flags = (unsigned char) fgetc(l_in_file); | ||
999 | |||
1000 | /* Ignore time stamp(4), extra flags(1), OS type(1) */ | ||
1001 | for (i = 0; i < 6; i++) { | ||
1002 | fgetc(l_in_file); | ||
1003 | } | ||
1004 | 867 | ||
1005 | if (flags & 0x04) { | 868 | /* Create the crc table */ |
1006 | /* bit 2 set: extra field present */ | 869 | make_gunzip_crc_table(); |
1007 | const unsigned short extra = | ||
1008 | fgetc(l_in_file) + (fgetc(l_in_file) << 8); | ||
1009 | if (feof(in_file)) return 1; | ||
1010 | for (i = 0; i < extra; i++) { | ||
1011 | fgetc(l_in_file); | ||
1012 | } | ||
1013 | } | ||
1014 | |||
1015 | /* Discard original name if any */ | ||
1016 | if (flags & 0x08) { | ||
1017 | /* bit 3 set: original file name present */ | ||
1018 | while (fgetc(l_in_file) != 0 && !feof(l_in_file)); /* null */ | ||
1019 | } | ||
1020 | 870 | ||
1021 | /* Discard file comment if any */ | 871 | /* decompress until the last block */ |
1022 | if (flags & 0x10) { | 872 | do { |
1023 | /* bit 4 set: file comment present */ | 873 | gunzip_hufts = 0; |
1024 | while (fgetc(l_in_file) != 0 && !feof(l_in_file)); /* null */ | 874 | r = inflate_block(&e); |
875 | if (r != 0) { | ||
876 | error_msg_and_die("inflate error %d", r); | ||
877 | return r; | ||
1025 | } | 878 | } |
1026 | 879 | if (gunzip_hufts > h) { | |
1027 | /* Decompress */ | 880 | h = gunzip_hufts; |
1028 | if (inflate(l_in_file, l_out_file) != 0) { | ||
1029 | error_msg("invalid compressed data--format violated"); | ||
1030 | } | 881 | } |
882 | } while (!e); | ||
1031 | 883 | ||
1032 | /* Get the crc and original length | 884 | /* write any buffered uncompressed data */ |
1033 | * crc32 (see algorithm.doc) | 885 | flush_gunzip_window(); |
1034 | * uncompressed input size modulo 2^32 | 886 | free(gunzip_window); |
1035 | */ | 887 | |
1036 | fread(buf, 1, 8, l_in_file); | 888 | /* Cleanup */ |
1037 | 889 | free(gunzip_crc_table); | |
1038 | /* Validate decompression - crc */ | 890 | |
1039 | if ((unsigned int) ((buf[0] | (buf[1] << 8)) | | 891 | /* Store unused bytes in a global buffer so calling applets can access it */ |
1040 | ((buf[2] | (buf[3] << 8)) << 16)) != | 892 | gunzip_in_buffer_count = 0; |
1041 | (crc ^ 0xffffffffL)) { | 893 | if (gunzip_bk >= 8) { |
1042 | error_msg("invalid compressed data--crc error"); | 894 | /* Undo too much lookahead. The next read will be byte aligned |
1043 | } | 895 | * so we can discard unused bits in the last meaningful byte. */ |
1044 | /* Validate decompression - size */ | 896 | gunzip_in_buffer[gunzip_in_buffer_count] = gunzip_bb & 0xff; |
1045 | if (((buf[4] | (buf[5] << 8)) | ((buf[6] | (buf[7] << 8)) << 16)) != | 897 | gunzip_in_buffer_count++; |
1046 | (unsigned long) bytes_out) { | 898 | gunzip_bb >>= 8; |
1047 | error_msg("invalid compressed data--length error"); | 899 | gunzip_bk -= 8; |
1048 | } | 900 | } |
1049 | 901 | ||
902 | /* return success */ | ||
1050 | return 0; | 903 | return 0; |
1051 | } | 904 | } |
1052 | |||
1053 | /* | ||
1054 | * This needs access to global variables window and crc_table, so its not in its own file. | ||
1055 | */ | ||
1056 | extern void gz_close(int gunzip_pid) | ||
1057 | { | ||
1058 | if (kill(gunzip_pid, SIGTERM) == -1) { | ||
1059 | error_msg_and_die | ||
1060 | ("*** Couldnt kill old gunzip process *** aborting"); | ||
1061 | } | ||
1062 | |||
1063 | if (waitpid(gunzip_pid, NULL, 0) == -1) { | ||
1064 | printf("Couldnt wait ?"); | ||
1065 | } | ||
1066 | |||
1067 | free(window); | ||
1068 | free(crc_table); | ||
1069 | } | ||
diff --git a/archival/libunarchive/filter_accept_all.c b/archival/libunarchive/filter_accept_all.c new file mode 100644 index 000000000..0471ccef0 --- /dev/null +++ b/archival/libunarchive/filter_accept_all.c | |||
@@ -0,0 +1,10 @@ | |||
1 | #include <fnmatch.h> | ||
2 | #include <stdlib.h> | ||
3 | #include "unarchive.h" | ||
4 | /* | ||
5 | * Accept names that are in the accept list | ||
6 | */ | ||
7 | extern char filter_accept_all(const llist_t *accept_list, const llist_t *reject_list, const char *key) | ||
8 | { | ||
9 | return(EXIT_SUCCESS); | ||
10 | } | ||
diff --git a/archival/libunarchive/filter_accept_list.c b/archival/libunarchive/filter_accept_list.c new file mode 100644 index 000000000..06b1dd3dd --- /dev/null +++ b/archival/libunarchive/filter_accept_list.c | |||
@@ -0,0 +1,16 @@ | |||
1 | #include <fnmatch.h> | ||
2 | #include <stdlib.h> | ||
3 | #include "unarchive.h" | ||
4 | /* | ||
5 | * Accept names that are in the accept list | ||
6 | */ | ||
7 | extern char filter_accept_list(const llist_t *accept_list, const llist_t *reject_list, const char *key) | ||
8 | { | ||
9 | while (accept_list) { | ||
10 | if (fnmatch(accept_list->data, key, 0) == 0) { | ||
11 | return(EXIT_SUCCESS); | ||
12 | } | ||
13 | accept_list = accept_list->link; | ||
14 | } | ||
15 | return(EXIT_FAILURE); | ||
16 | } | ||
diff --git a/archival/libunarchive/filter_accept_reject_list.c b/archival/libunarchive/filter_accept_reject_list.c new file mode 100644 index 000000000..c893dfcfc --- /dev/null +++ b/archival/libunarchive/filter_accept_reject_list.c | |||
@@ -0,0 +1,34 @@ | |||
1 | #include <fnmatch.h> | ||
2 | #include <stdlib.h> | ||
3 | #include "unarchive.h" | ||
4 | |||
5 | static char check_list(const llist_t *list, const char *filename) | ||
6 | { | ||
7 | if (list) { | ||
8 | while (list) { | ||
9 | if (fnmatch(list->data, filename, 0) == 0) { | ||
10 | return(EXIT_SUCCESS); | ||
11 | } | ||
12 | list = list->link; | ||
13 | } | ||
14 | } | ||
15 | return(EXIT_FAILURE); | ||
16 | } | ||
17 | |||
18 | /* | ||
19 | * Accept names that are in the accept list | ||
20 | */ | ||
21 | extern char filter_accept_reject_list(const llist_t *accept_list, const llist_t *reject_list, const char *key) | ||
22 | { | ||
23 | /* Fail if an accept list was specified and the key wasnt in there */ | ||
24 | if ((accept_list) && (check_list(accept_list, key) == EXIT_FAILURE)) { | ||
25 | return(EXIT_FAILURE); | ||
26 | } | ||
27 | |||
28 | /* If the key is in a reject list fail */ | ||
29 | if (check_list(reject_list, key) == EXIT_FAILURE) { | ||
30 | return(EXIT_FAILURE); | ||
31 | } | ||
32 | |||
33 | return(EXIT_SUCCESS); | ||
34 | } | ||
diff --git a/archival/libunarchive/get_header_ar.c b/archival/libunarchive/get_header_ar.c index f172fa7c9..b7f2cfbcd 100644 --- a/archival/libunarchive/get_header_ar.c +++ b/archival/libunarchive/get_header_ar.c | |||
@@ -17,12 +17,13 @@ | |||
17 | #include <stdio.h> | 17 | #include <stdio.h> |
18 | #include <stdlib.h> | 18 | #include <stdlib.h> |
19 | #include <string.h> | 19 | #include <string.h> |
20 | #include <unistd.h> | ||
20 | #include "unarchive.h" | 21 | #include "unarchive.h" |
21 | #include "libbb.h" | 22 | #include "libbb.h" |
22 | 23 | ||
23 | file_header_t *get_header_ar(FILE *src_stream) | 24 | extern char get_header_ar(archive_handle_t *archive_handle) |
24 | { | 25 | { |
25 | file_header_t *typed; | 26 | file_header_t *typed = archive_handle->file_header; |
26 | union { | 27 | union { |
27 | char raw[60]; | 28 | char raw[60]; |
28 | struct { | 29 | struct { |
@@ -35,72 +36,87 @@ file_header_t *get_header_ar(FILE *src_stream) | |||
35 | char magic[2]; | 36 | char magic[2]; |
36 | } formated; | 37 | } formated; |
37 | } ar; | 38 | } ar; |
39 | #ifdef CONFIG_FEATURE_AR_LONG_FILENAMES | ||
38 | static char *ar_long_names; | 40 | static char *ar_long_names; |
41 | static unsigned int ar_long_name_size; | ||
42 | #endif | ||
39 | 43 | ||
40 | if (fread(ar.raw, 1, 60, src_stream) != 60) { | 44 | /* dont use xread as we want to handle the error ourself */ |
41 | return(NULL); | 45 | if (read(archive_handle->src_fd, ar.raw, 60) != 60) { |
42 | } | 46 | /* End Of File */ |
43 | archive_offset += 60; | 47 | return(EXIT_FAILURE); |
44 | /* align the headers based on the header magic */ | ||
45 | if ((ar.formated.magic[0] != '`') || (ar.formated.magic[1] != '\n')) { | ||
46 | /* some version of ar, have an extra '\n' after each data entry, | ||
47 | * this puts the next header out by 1 */ | ||
48 | if (ar.formated.magic[1] != '`') { | ||
49 | error_msg("Invalid magic"); | ||
50 | return(NULL); | ||
51 | } | ||
52 | /* read the next char out of what would be the data section, | ||
53 | * if its a '\n' then it is a valid header offset by 1*/ | ||
54 | archive_offset++; | ||
55 | if (fgetc(src_stream) != '\n') { | ||
56 | error_msg("Invalid magic"); | ||
57 | return(NULL); | ||
58 | } | 48 | } |
49 | |||
50 | /* Some ar entries have a trailing '\n' after the previous data entry */ | ||
51 | if (ar.raw[0] == '\n') { | ||
59 | /* fix up the header, we started reading 1 byte too early */ | 52 | /* fix up the header, we started reading 1 byte too early */ |
60 | /* raw_header[60] wont be '\n' as it should, but it doesnt matter */ | ||
61 | memmove(ar.raw, &ar.raw[1], 59); | 53 | memmove(ar.raw, &ar.raw[1], 59); |
54 | ar.raw[59] = xread_char(archive_handle->src_fd); | ||
55 | archive_handle->offset++; | ||
62 | } | 56 | } |
57 | archive_handle->offset += 60; | ||
63 | 58 | ||
64 | typed = (file_header_t *) xcalloc(1, sizeof(file_header_t)); | 59 | /* align the headers based on the header magic */ |
60 | if ((ar.formated.magic[0] != '`') || (ar.formated.magic[1] != '\n')) { | ||
61 | error_msg_and_die("Invalid ar header"); | ||
62 | } | ||
63 | |||
64 | typed->mode = strtol(ar.formated.mode, NULL, 8); | ||
65 | typed->mtime = atoi(ar.formated.date); | ||
66 | typed->uid = atoi(ar.formated.uid); | ||
67 | typed->gid = atoi(ar.formated.gid); | ||
68 | typed->size = atoi(ar.formated.size); | ||
65 | 69 | ||
66 | typed->size = (size_t) atoi(ar.formated.size); | ||
67 | /* long filenames have '/' as the first character */ | 70 | /* long filenames have '/' as the first character */ |
68 | if (ar.formated.name[0] == '/') { | 71 | if (ar.formated.name[0] == '/') { |
72 | #ifdef CONFIG_FEATURE_AR_LONG_FILENAMES | ||
69 | if (ar.formated.name[1] == '/') { | 73 | if (ar.formated.name[1] == '/') { |
70 | /* If the second char is a '/' then this entries data section | 74 | /* If the second char is a '/' then this entries data section |
71 | * stores long filename for multiple entries, they are stored | 75 | * stores long filename for multiple entries, they are stored |
72 | * in static variable long_names for use in future entries */ | 76 | * in static variable long_names for use in future entries */ |
73 | ar_long_names = (char *) xrealloc(ar_long_names, typed->size); | 77 | ar_long_name_size = typed->size; |
74 | fread(ar_long_names, 1, typed->size, src_stream); | 78 | ar_long_names = xmalloc(ar_long_name_size); |
75 | archive_offset += typed->size; | 79 | xread_all(archive_handle->src_fd, ar_long_names, ar_long_name_size); |
80 | archive_handle->offset += ar_long_name_size; | ||
76 | /* This ar entries data section only contained filenames for other records | 81 | /* This ar entries data section only contained filenames for other records |
77 | * they are stored in the static ar_long_names for future reference */ | 82 | * they are stored in the static ar_long_names for future reference */ |
78 | return (get_header_ar(src_stream)); /* Return next header */ | 83 | return (get_header_ar(archive_handle)); /* Return next header */ |
79 | } else if (ar.formated.name[1] == ' ') { | 84 | } else if (ar.formated.name[1] == ' ') { |
80 | /* This is the index of symbols in the file for compilers */ | 85 | /* This is the index of symbols in the file for compilers */ |
81 | seek_sub_file(src_stream, typed->size); | 86 | data_skip(archive_handle); |
82 | return (get_header_ar(src_stream)); /* Return next header */ | 87 | return (get_header_ar(archive_handle)); /* Return next header */ |
83 | } else { | 88 | } else { |
84 | /* The number after the '/' indicates the offset in the ar data section | 89 | /* The number after the '/' indicates the offset in the ar data section |
85 | (saved in variable long_name) that conatains the real filename */ | 90 | (saved in variable long_name) that conatains the real filename */ |
86 | if (!ar_long_names) { | 91 | const unsigned int long_offset = atoi(&ar.formated.name[1]); |
87 | error_msg("Cannot resolve long file name"); | 92 | if (long_offset >= ar_long_name_size) { |
88 | return (NULL); | 93 | error_msg_and_die("Cant resolve long filename"); |
89 | } | 94 | } |
90 | typed->name = xstrdup(ar_long_names + atoi(&ar.formated.name[1])); | 95 | typed->name = xstrdup(ar_long_names + long_offset); |
91 | } | 96 | } |
97 | #else | ||
98 | error_msg_and_die("long filenames not supported"); | ||
99 | #endif | ||
92 | } else { | 100 | } else { |
93 | /* short filenames */ | 101 | /* short filenames */ |
94 | typed->name = xstrndup(ar.formated.name, 16); | 102 | typed->name = xstrndup(ar.formated.name, 16); |
95 | } | 103 | } |
96 | typed->name[strcspn(typed->name, " /")]='\0'; | ||
97 | 104 | ||
98 | /* convert the rest of the now valid char header to its typed struct */ | 105 | typed->name[strcspn(typed->name, " /")] = '\0'; |
99 | parse_mode(ar.formated.mode, &typed->mode); | 106 | |
100 | typed->mtime = atoi(ar.formated.date); | 107 | if (archive_handle->filter(archive_handle->accept, archive_handle->reject, typed->name) == EXIT_SUCCESS) { |
101 | typed->uid = atoi(ar.formated.uid); | 108 | archive_handle->action_header(typed); |
102 | typed->gid = atoi(ar.formated.gid); | 109 | if (archive_handle->sub_archive) { |
110 | while (archive_handle->action_data_subarchive(archive_handle->sub_archive) == EXIT_SUCCESS); | ||
111 | } else { | ||
112 | archive_handle->action_data(archive_handle); | ||
113 | } | ||
114 | } else { | ||
115 | data_skip(archive_handle); | ||
116 | } | ||
117 | |||
118 | archive_handle->offset += typed->size + 1; | ||
103 | 119 | ||
104 | return(typed); | 120 | return(EXIT_SUCCESS); |
105 | } | 121 | } |
106 | 122 | ||
diff --git a/archival/libunarchive/get_header_tar.c b/archival/libunarchive/get_header_tar.c index e6747b72f..2c8fc0aa0 100644 --- a/archival/libunarchive/get_header_tar.c +++ b/archival/libunarchive/get_header_tar.c | |||
@@ -20,8 +20,9 @@ | |||
20 | #include "unarchive.h" | 20 | #include "unarchive.h" |
21 | #include "libbb.h" | 21 | #include "libbb.h" |
22 | 22 | ||
23 | file_header_t *get_header_tar(FILE * tar_stream) | 23 | extern char get_header_tar(archive_handle_t *archive_handle) |
24 | { | 24 | { |
25 | file_header_t *file_header = archive_handle->file_header; | ||
25 | union { | 26 | union { |
26 | unsigned char raw[512]; | 27 | unsigned char raw[512]; |
27 | struct { | 28 | struct { |
@@ -44,20 +45,22 @@ file_header_t *get_header_tar(FILE * tar_stream) | |||
44 | char padding[12]; /* 500-512 */ | 45 | char padding[12]; /* 500-512 */ |
45 | } formated; | 46 | } formated; |
46 | } tar; | 47 | } tar; |
47 | file_header_t *tar_entry = NULL; | ||
48 | long sum = 0; | 48 | long sum = 0; |
49 | long i; | 49 | long i; |
50 | 50 | ||
51 | if (archive_offset % 512 != 0) { | 51 | /* Align header */ |
52 | seek_sub_file(tar_stream, 512 - (archive_offset % 512)); | 52 | archive_handle->offset += data_align(archive_handle->src_fd, archive_handle->offset, 512); |
53 | |||
54 | if (xread_all_eof(archive_handle->src_fd, tar.raw, 512) == 0) { | ||
55 | /* End of file */ | ||
56 | return(EXIT_FAILURE); | ||
53 | } | 57 | } |
58 | archive_handle->offset += 512; | ||
54 | 59 | ||
55 | if (fread(tar.raw, 1, 512, tar_stream) != 512) { | 60 | /* If there is no filename its an empty header */ |
56 | /* Unfortunatly its common for tar files to have all sorts of | 61 | if (tar.formated.name[0] == 0) { |
57 | * trailing garbage, fail silently */ | 62 | return(EXIT_SUCCESS); |
58 | return (NULL); | ||
59 | } | 63 | } |
60 | archive_offset += 512; | ||
61 | 64 | ||
62 | /* Check header has valid magic, "ustar" is for the proper tar | 65 | /* Check header has valid magic, "ustar" is for the proper tar |
63 | * 0's are for the old tar format | 66 | * 0's are for the old tar format |
@@ -66,100 +69,102 @@ file_header_t *get_header_tar(FILE * tar_stream) | |||
66 | #ifdef CONFIG_FEATURE_TAR_OLD_FORMAT | 69 | #ifdef CONFIG_FEATURE_TAR_OLD_FORMAT |
67 | if (strncmp(tar.formated.magic, "\0\0\0\0\0", 5) != 0) | 70 | if (strncmp(tar.formated.magic, "\0\0\0\0\0", 5) != 0) |
68 | #endif | 71 | #endif |
69 | return (NULL); | 72 | error_msg_and_die("Invalid tar magic"); |
70 | } | ||
71 | |||
72 | /* If there is no filename its an empty header, skip it */ | ||
73 | if (tar.formated.name[0] == 0) { | ||
74 | return (NULL); | ||
75 | } | 73 | } |
76 | 74 | ||
77 | /* Do checksum on headers */ | 75 | /* Do checksum on headers */ |
78 | for (i = 0; i < 148; i++) { | 76 | for (i = 0; i < 148 ; i++) { |
79 | sum += tar.raw[i]; | 77 | sum += tar.raw[i]; |
80 | } | 78 | } |
81 | sum += ' ' * 8; | 79 | sum += ' ' * 8; |
82 | for (i = 156; i < 512; i++) { | 80 | for (i = 156; i < 512 ; i++) { |
83 | sum += tar.raw[i]; | 81 | sum += tar.raw[i]; |
84 | } | 82 | } |
85 | if (sum != strtol(tar.formated.chksum, NULL, 8)) { | 83 | if (sum != strtol(tar.formated.chksum, NULL, 8)) { |
86 | error_msg("Invalid tar header checksum"); | 84 | error_msg("Invalid tar header checksum"); |
87 | return (NULL); | 85 | return(EXIT_FAILURE); |
88 | } | 86 | } |
89 | 87 | ||
90 | /* convert to type'ed variables */ | 88 | /* convert to type'ed variables */ |
91 | tar_entry = xcalloc(1, sizeof(file_header_t)); | ||
92 | if (tar.formated.prefix[0] == 0) { | 89 | if (tar.formated.prefix[0] == 0) { |
93 | tar_entry->name = xstrdup(tar.formated.name); | 90 | file_header->name = strdup(tar.formated.name); |
94 | } else { | 91 | } else { |
95 | tar_entry->name = | 92 | file_header->name = concat_path_file(tar.formated.prefix, tar.formated.name); |
96 | concat_path_file(tar.formated.prefix, tar.formated.name); | ||
97 | } | 93 | } |
98 | 94 | file_header->mode = strtol(tar.formated.mode, NULL, 8); | |
99 | tar_entry->mode = strtol(tar.formated.mode, NULL, 8); | 95 | file_header->uid = strtol(tar.formated.uid, NULL, 8); |
100 | tar_entry->uid = strtol(tar.formated.uid, NULL, 8); | 96 | file_header->gid = strtol(tar.formated.gid, NULL, 8); |
101 | tar_entry->gid = strtol(tar.formated.gid, NULL, 8); | 97 | file_header->size = strtol(tar.formated.size, NULL, 8); |
102 | tar_entry->size = strtol(tar.formated.size, NULL, 8); | 98 | file_header->mtime = strtol(tar.formated.mtime, NULL, 8); |
103 | tar_entry->mtime = strtol(tar.formated.mtime, NULL, 8); | 99 | file_header->link_name = (tar.formated.linkname[0] != '\0') ? |
104 | tar_entry->link_name = | 100 | xstrdup(tar.formated.linkname) : NULL; |
105 | strlen(tar.formated.linkname) ? xstrdup(tar.formated.linkname) : NULL; | 101 | file_header->device = (dev_t) ((strtol(tar.formated.devmajor, NULL, 8) << 8) + |
106 | tar_entry->device = | ||
107 | (dev_t) ((strtol(tar.formated.devmajor, NULL, 8) << 8) + | ||
108 | strtol(tar.formated.devminor, NULL, 8)); | 102 | strtol(tar.formated.devminor, NULL, 8)); |
109 | 103 | ||
110 | #if defined CONFIG_FEATURE_TAR_OLD_FORMAT || defined CONFIG_FEATURE_GNUTAR_LONG_FILENAME | 104 | #if defined CONFIG_FEATURE_TAR_OLD_FORMAT || defined CONFIG_FEATURE_GNUTAR_LONG_FILENAME |
105 | /* Fix mode, used by the old format */ | ||
111 | switch (tar.formated.typeflag) { | 106 | switch (tar.formated.typeflag) { |
112 | # ifdef CONFIG_FEATURE_TAR_OLD_FORMAT | 107 | # ifdef CONFIG_FEATURE_TAR_OLD_FORMAT |
113 | case 0: | 108 | case 0: |
114 | tar_entry->mode |= S_IFREG; | 109 | file_header->mode |= S_IFREG; |
115 | break; | 110 | break; |
116 | case 1: | 111 | case 1: |
117 | error_msg("internal hard link not handled\n"); | 112 | error_msg("Internal hard link not supported"); |
118 | break; | 113 | break; |
119 | case 2: | 114 | case 2: |
120 | tar_entry->mode |= S_IFLNK; | 115 | file_header->mode |= S_IFLNK; |
121 | break; | 116 | break; |
122 | case 3: | 117 | case 3: |
123 | tar_entry->mode |= S_IFCHR; | 118 | file_header->mode |= S_IFCHR; |
124 | break; | 119 | break; |
125 | case 4: | 120 | case 4: |
126 | tar_entry->mode |= S_IFBLK; | 121 | file_header->mode |= S_IFBLK; |
127 | break; | 122 | break; |
128 | case 5: | 123 | case 5: |
129 | tar_entry->mode |= S_IFDIR; | 124 | file_header->mode |= S_IFDIR; |
130 | break; | 125 | break; |
131 | case 6: | 126 | case 6: |
132 | tar_entry->mode |= S_IFIFO; | 127 | file_header->mode |= S_IFIFO; |
133 | break; | 128 | break; |
134 | # endif | 129 | # endif |
135 | # ifdef CONFIG_FEATURE_GNUTAR_LONG_FILENAME | 130 | # ifdef CONFIG_FEATURE_GNUTAR_LONG_FILENAME |
136 | case 'L': { | 131 | case 'L': { |
137 | char *longname; | 132 | char *longname; |
138 | 133 | ||
139 | longname = xmalloc(tar_entry->size + 1); | 134 | longname = xmalloc(file_header->size + 1); |
140 | fread(longname, 1, tar_entry->size, tar_stream); | 135 | xread_all(archive_handle->src_fd, longname, file_header->size); |
141 | archive_offset += tar_entry->size; | 136 | longname[file_header->size] = '\0'; |
142 | longname[tar_entry->size] = '\0'; | 137 | archive_handle->offset += file_header->size; |
143 | 138 | ||
144 | tar_entry = get_header_tar(tar_stream); | 139 | get_header_tar(archive_handle); |
145 | tar_entry->name = longname; | 140 | file_header->name = longname; |
146 | break; | 141 | break; |
147 | } | 142 | } |
148 | case 'K': { | 143 | case 'K': { |
149 | char *longname; | 144 | char *linkname; |
150 | 145 | ||
151 | longname = xmalloc(tar_entry->size + 1); | 146 | linkname = xmalloc(file_header->size + 1); |
152 | fread(longname, 1, tar_entry->size, tar_stream); | 147 | xread_all(archive_handle->src_fd, linkname, file_header->size); |
153 | archive_offset += tar_entry->size; | 148 | linkname[file_header->size] = '\0'; |
154 | longname[tar_entry->size] = '\0'; | 149 | archive_handle->offset += file_header->size; |
155 | 150 | ||
156 | tar_entry = get_header_tar(tar_stream); | 151 | get_header_tar(archive_handle); |
157 | tar_entry->link_name = longname; | 152 | file_header->name = linkname; |
158 | break; | 153 | break; |
159 | } | 154 | } |
160 | # endif | 155 | # endif |
161 | } | 156 | } |
162 | #endif | 157 | #endif |
163 | 158 | ||
164 | return (tar_entry); | 159 | if (archive_handle->filter(archive_handle->accept, archive_handle->reject, archive_handle->file_header->name) == EXIT_SUCCESS) { |
160 | archive_handle->action_header(archive_handle->file_header); | ||
161 | archive_handle->flags |= ARCHIVE_EXTRACT_QUIET; | ||
162 | archive_handle->action_data(archive_handle); | ||
163 | } else { | ||
164 | data_skip(archive_handle); | ||
165 | } | ||
166 | archive_handle->offset += file_header->size; | ||
167 | |||
168 | return(EXIT_SUCCESS); | ||
165 | } | 169 | } |
170 | |||
diff --git a/archival/libunarchive/get_header_tar_gz.c b/archival/libunarchive/get_header_tar_gz.c new file mode 100644 index 000000000..c06beac9d --- /dev/null +++ b/archival/libunarchive/get_header_tar_gz.c | |||
@@ -0,0 +1,73 @@ | |||
1 | /* | ||
2 | * This program is free software; you can redistribute it and/or modify | ||
3 | * it under the terms of the GNU General Public License as published by | ||
4 | * the Free Software Foundation; either version 2 of the License, or | ||
5 | * (at your option) any later version. | ||
6 | * | ||
7 | * This program is distributed in the hope that it will be useful, | ||
8 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
9 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
10 | * GNU Library General Public License for more details. | ||
11 | * | ||
12 | * You should have received a copy of the GNU General Public License | ||
13 | * along with this program; if not, write to the Free Software | ||
14 | * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. | ||
15 | */ | ||
16 | |||
17 | #include <sys/types.h> | ||
18 | #include <signal.h> | ||
19 | #include <stdio.h> | ||
20 | #include <stdlib.h> | ||
21 | #include <string.h> | ||
22 | #include <unistd.h> | ||
23 | #include "libbb.h" | ||
24 | #include "unarchive.h" | ||
25 | |||
26 | extern char get_header_tar_gz(archive_handle_t *archive_handle) | ||
27 | { | ||
28 | int fd_pipe[2]; | ||
29 | int pid; | ||
30 | |||
31 | check_header_gzip(archive_handle->src_fd); | ||
32 | |||
33 | if (pipe(fd_pipe) != 0) { | ||
34 | error_msg_and_die("Can't create pipe\n"); | ||
35 | } | ||
36 | |||
37 | pid = fork(); | ||
38 | if (pid == -1) { | ||
39 | error_msg_and_die("Fork failed\n"); | ||
40 | } | ||
41 | |||
42 | if (pid == 0) { | ||
43 | /* child process */ | ||
44 | close(fd_pipe[0]); /* We don't wan't to read from the pipe */ | ||
45 | inflate(archive_handle->src_fd, fd_pipe[1]); | ||
46 | check_trailer_gzip(archive_handle->src_fd); | ||
47 | close(fd_pipe[1]); /* Send EOF */ | ||
48 | exit(0); | ||
49 | /* notreached */ | ||
50 | } | ||
51 | /* parent process */ | ||
52 | close(fd_pipe[1]); /* Don't want to write down the pipe */ | ||
53 | close(archive_handle->src_fd); | ||
54 | |||
55 | archive_handle->src_fd = fd_pipe[0]; | ||
56 | |||
57 | while (get_header_tar(archive_handle) == EXIT_SUCCESS); | ||
58 | |||
59 | if (kill(pid, SIGTERM) == -1) { | ||
60 | error_msg_and_die("Couldnt kill gunzip process"); | ||
61 | } | ||
62 | |||
63 | /* I dont think this is needed */ | ||
64 | #if 0 | ||
65 | if (waitpid(pid, NULL, 0) == -1) { | ||
66 | error_msg("Couldnt wait ?"); | ||
67 | } | ||
68 | #endif | ||
69 | |||
70 | /* Can only do one file at a time */ | ||
71 | return(EXIT_FAILURE); | ||
72 | } | ||
73 | |||
diff --git a/archival/libunarchive/header_list.c b/archival/libunarchive/header_list.c new file mode 100644 index 000000000..5849a762e --- /dev/null +++ b/archival/libunarchive/header_list.c | |||
@@ -0,0 +1,7 @@ | |||
1 | #include <stdio.h> | ||
2 | #include "unarchive.h" | ||
3 | |||
4 | extern void header_list(const file_header_t *file_header) | ||
5 | { | ||
6 | puts(file_header->name); | ||
7 | } | ||
diff --git a/archival/libunarchive/header_skip.c b/archival/libunarchive/header_skip.c new file mode 100644 index 000000000..4430178f8 --- /dev/null +++ b/archival/libunarchive/header_skip.c | |||
@@ -0,0 +1,7 @@ | |||
1 | #include <stdio.h> | ||
2 | #include "unarchive.h" | ||
3 | |||
4 | extern void header_skip(const file_header_t *file_header) | ||
5 | { | ||
6 | return; | ||
7 | } | ||
diff --git a/archival/libunarchive/header_verbose_list.c b/archival/libunarchive/header_verbose_list.c new file mode 100644 index 000000000..ff7b3bca2 --- /dev/null +++ b/archival/libunarchive/header_verbose_list.c | |||
@@ -0,0 +1,29 @@ | |||
1 | #include <stdio.h> | ||
2 | #include <string.h> | ||
3 | #include <time.h> | ||
4 | #include "libbb.h" | ||
5 | #include "unarchive.h" | ||
6 | |||
7 | extern void header_verbose_list(const file_header_t *file_header) | ||
8 | { | ||
9 | struct tm *mtime = localtime(&file_header->mtime); | ||
10 | |||
11 | printf("%s %d/%d%10u %4u-%02u-%02u %02u:%02u:%02u %s", | ||
12 | mode_string(file_header->mode), | ||
13 | file_header->uid, | ||
14 | file_header->gid, | ||
15 | (unsigned int) file_header->size, | ||
16 | 1900 + mtime->tm_year, | ||
17 | 1 + mtime->tm_mon, | ||
18 | mtime->tm_mday, | ||
19 | mtime->tm_hour, | ||
20 | mtime->tm_min, | ||
21 | mtime->tm_sec, | ||
22 | file_header->name); | ||
23 | |||
24 | if (file_header->link_name) { | ||
25 | printf(" -> %s", file_header->link_name); | ||
26 | } | ||
27 | /* putchar isnt used anywhere else i dont think */ | ||
28 | puts(""); | ||
29 | } | ||
diff --git a/archival/libunarchive/init_handle.c b/archival/libunarchive/init_handle.c new file mode 100644 index 000000000..12d9e7183 --- /dev/null +++ b/archival/libunarchive/init_handle.c | |||
@@ -0,0 +1,18 @@ | |||
1 | #include <string.h> | ||
2 | #include "libbb.h" | ||
3 | #include "unarchive.h" | ||
4 | |||
5 | archive_handle_t *init_handle(void) | ||
6 | { | ||
7 | archive_handle_t *archive_handle; | ||
8 | |||
9 | /* Initialise default values */ | ||
10 | archive_handle = xmalloc(sizeof(archive_handle_t)); | ||
11 | memset(archive_handle, 0, sizeof(archive_handle_t)); | ||
12 | archive_handle->file_header = xmalloc(sizeof(file_header_t)); | ||
13 | archive_handle->action_header = header_skip; | ||
14 | archive_handle->action_data = data_skip; | ||
15 | archive_handle->filter = filter_accept_all; | ||
16 | |||
17 | return(archive_handle); | ||
18 | } | ||
diff --git a/archival/libunarchive/seek_sub_file.c b/archival/libunarchive/seek_sub_file.c index 7523a52ab..733bb36a9 100644 --- a/archival/libunarchive/seek_sub_file.c +++ b/archival/libunarchive/seek_sub_file.c | |||
@@ -14,23 +14,19 @@ | |||
14 | * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. | 14 | * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
15 | */ | 15 | */ |
16 | 16 | ||
17 | #include <stdio.h> | 17 | #include <sys/types.h> |
18 | #include <errno.h> | 18 | #include <errno.h> |
19 | #include <stdlib.h> | ||
20 | #include <unistd.h> | 19 | #include <unistd.h> |
20 | #include <stdlib.h> | ||
21 | #include "unarchive.h" | ||
22 | #include "libbb.h" | ||
21 | 23 | ||
22 | off_t archive_offset; | 24 | extern void seek_sub_file(const int src_fd, const unsigned int amount) |
23 | |||
24 | void seek_sub_file(FILE *src_stream, const int count) | ||
25 | { | 25 | { |
26 | /* Try to fseek as faster */ | 26 | if ((lseek(src_fd, amount, SEEK_CUR) == -1) && (errno == ESPIPE)) { |
27 | archive_offset += count; | 27 | unsigned int i; |
28 | if (fseek(src_stream, count, SEEK_CUR) != 0 && errno == ESPIPE) { | 28 | for (i = 0; i < amount; i++) { |
29 | int i; | 29 | xread_char(src_fd); |
30 | for (i = 0; i < count; i++) { | ||
31 | fgetc(src_stream); | ||
32 | } | 30 | } |
33 | } | 31 | } |
34 | return; | ||
35 | } | 32 | } |
36 | |||
diff --git a/archival/libunarchive/unpack_ar_archive.c b/archival/libunarchive/unpack_ar_archive.c new file mode 100644 index 000000000..923b8a068 --- /dev/null +++ b/archival/libunarchive/unpack_ar_archive.c | |||
@@ -0,0 +1,34 @@ | |||
1 | /* | ||
2 | * This program is free software; you can redistribute it and/or modify | ||
3 | * it under the terms of the GNU General Public License as published by | ||
4 | * the Free Software Foundation; either version 2 of the License, or | ||
5 | * (at your option) any later version. | ||
6 | * | ||
7 | * This program is distributed in the hope that it will be useful, | ||
8 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
9 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
10 | * GNU Library General Public License for more details. | ||
11 | * | ||
12 | * You should have received a copy of the GNU General Public License | ||
13 | * along with this program; if not, write to the Free Software | ||
14 | * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. | ||
15 | */ | ||
16 | #include <fcntl.h> | ||
17 | #include <stdlib.h> | ||
18 | #include <string.h> | ||
19 | #include <getopt.h> | ||
20 | #include "unarchive.h" | ||
21 | #include "busybox.h" | ||
22 | |||
23 | extern void unpack_ar_archive(archive_handle_t *ar_archive) | ||
24 | { | ||
25 | char magic[7]; | ||
26 | |||
27 | xread_all(ar_archive->src_fd, magic, 7); | ||
28 | if (strncmp(magic, "!<arch>", 7) != 0) { | ||
29 | error_msg_and_die("Invalid ar magic"); | ||
30 | } | ||
31 | ar_archive->offset += 7; | ||
32 | |||
33 | while (get_header_ar(ar_archive) == EXIT_SUCCESS); | ||
34 | } | ||
diff --git a/archival/libunarchive/unzip.c b/archival/libunarchive/unzip.c index d84067068..20bf88f55 100644 --- a/archival/libunarchive/unzip.c +++ b/archival/libunarchive/unzip.c | |||
@@ -65,114 +65,126 @@ static char *license_msg[] = { | |||
65 | #include <signal.h> | 65 | #include <signal.h> |
66 | #include <stdlib.h> | 66 | #include <stdlib.h> |
67 | #include <string.h> | 67 | #include <string.h> |
68 | #include <unistd.h> | ||
69 | #include <fcntl.h> | ||
68 | #include "config.h" | 70 | #include "config.h" |
69 | #include "libbb.h" | 71 | #include "busybox.h" |
72 | #include "unarchive.h" | ||
70 | 73 | ||
71 | #ifdef CONFIG_FEATURE_UNCOMPRESS | 74 | typedef struct huft_s { |
72 | int uncompress(FILE * in, FILE * out); | 75 | unsigned char e; /* number of extra bits or operation */ |
73 | #endif | 76 | unsigned char b; /* number of bits in this code or subcode */ |
74 | 77 | union { | |
75 | static FILE *in_file, *out_file; | 78 | unsigned short n; /* literal, length base, or distance base */ |
79 | struct huft_s *t; /* pointer to next level of table */ | ||
80 | } v; | ||
81 | } huft_t; | ||
76 | 82 | ||
77 | /* these are freed by gz_close */ | 83 | static int gunzip_src_fd; |
78 | static unsigned char *window; | 84 | static int gunzip_dst_fd; |
79 | static unsigned long *crc_table; | 85 | unsigned int gunzip_bytes_out; /* number of output bytes */ |
86 | static unsigned int gunzip_outbuf_count; /* bytes in output buffer */ | ||
80 | 87 | ||
81 | static unsigned long crc; /* shift register contents */ | 88 | /* This is used to sanify any unused bits from the bitbuffer |
89 | * so they arent skipped when reading trailers (trailing headers) */ | ||
90 | unsigned char gunzip_in_buffer_count; | ||
91 | unsigned char *gunzip_in_buffer; | ||
82 | 92 | ||
83 | /* Return codes from gzip */ | 93 | /* gunzip_window size--must be a power of two, and |
84 | #define ERROR 1 | 94 | * at least 32K for zip's deflate method */ |
95 | static const int gunzip_wsize = 0x8000; | ||
85 | 96 | ||
86 | /* | 97 | static unsigned char *gunzip_window; |
87 | * window size--must be a power of two, and | 98 | static unsigned int *gunzip_crc_table; |
88 | * at least 32K for zip's deflate method | 99 | unsigned int gunzip_crc; |
89 | */ | ||
90 | #define WSIZE 0x8000 | ||
91 | 100 | ||
92 | /* If BMAX needs to be larger than 16, then h and x[] should be ulg. */ | 101 | /* If BMAX needs to be larger than 16, then h and x[] should be ulg. */ |
93 | #define BMAX 16 /* maximum bit length of any code (16 for explode) */ | 102 | #define BMAX 16 /* maximum bit length of any code (16 for explode) */ |
94 | #define N_MAX 288 /* maximum number of codes in any set */ | 103 | #define N_MAX 288 /* maximum number of codes in any set */ |
95 | 104 | ||
96 | static long bytes_out; /* number of output bytes */ | 105 | static unsigned int gunzip_hufts; /* track memory usage */ |
97 | static unsigned long outcnt; /* bytes in output buffer */ | 106 | static unsigned int gunzip_bb; /* bit buffer */ |
98 | 107 | static unsigned char gunzip_bk; /* bits in bit buffer */ | |
99 | static unsigned hufts; /* track memory usage */ | ||
100 | static unsigned long bb; /* bit buffer */ | ||
101 | static unsigned bk; /* bits in bit buffer */ | ||
102 | |||
103 | typedef struct huft_s { | ||
104 | unsigned char e; /* number of extra bits or operation */ | ||
105 | unsigned char b; /* number of bits in this code or subcode */ | ||
106 | union { | ||
107 | unsigned short n; /* literal, length base, or distance base */ | ||
108 | struct huft_s *t; /* pointer to next level of table */ | ||
109 | } v; | ||
110 | } huft_t; | ||
111 | 108 | ||
112 | static const unsigned short mask_bits[] = { | 109 | static const unsigned short mask_bits[] = { |
113 | 0x0000, | 110 | 0x0000, 0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff, |
114 | 0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff, | ||
115 | 0x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff | 111 | 0x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff |
116 | }; | 112 | }; |
117 | 113 | ||
118 | /* static int error_number = 0; */ | 114 | /* Copy lengths for literal codes 257..285 */ |
119 | /* ======================================================================== | 115 | static const unsigned short cplens[] = { |
120 | * Signal and error handler. | 116 | 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, |
121 | */ | 117 | 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0 |
118 | }; | ||
119 | |||
120 | /* note: see note #13 above about the 258 in this list. */ | ||
121 | /* Extra bits for literal codes 257..285 */ | ||
122 | static const unsigned char cplext[] = { | ||
123 | 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, | ||
124 | 5, 5, 5, 0, 99, 99 | ||
125 | }; /* 99==invalid */ | ||
126 | |||
127 | /* Copy offsets for distance codes 0..29 */ | ||
128 | static const unsigned short cpdist[] = { | ||
129 | 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, | ||
130 | 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577 | ||
131 | }; | ||
132 | |||
133 | /* Extra bits for distance codes */ | ||
134 | static const unsigned char cpdext[] = { | ||
135 | 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, | ||
136 | 11, 11, 12, 12, 13, 13 | ||
137 | }; | ||
138 | |||
139 | /* Tables for deflate from PKZIP's appnote.txt. */ | ||
140 | /* Order of the bit length code lengths */ | ||
141 | static const unsigned char border[] = { | ||
142 | 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 | ||
143 | }; | ||
144 | |||
145 | static unsigned int fill_bitbuffer(unsigned int bitbuffer, unsigned int *current, const unsigned int required) | ||
146 | { | ||
147 | while (*current < required) { | ||
148 | bitbuffer |= ((unsigned int) xread_char(gunzip_src_fd)) << *current; | ||
149 | *current += 8; | ||
150 | } | ||
151 | |||
152 | return(bitbuffer); | ||
153 | } | ||
122 | 154 | ||
123 | static void abort_gzip(void) | 155 | static void abort_gzip(void) |
124 | { | 156 | { |
125 | error_msg("gzip aborted\n"); | 157 | error_msg("gzip aborted\n"); |
126 | exit(ERROR); | 158 | exit(-1); |
127 | } | 159 | } |
128 | 160 | ||
129 | static void make_crc_table(void) | 161 | static void make_gunzip_crc_table(void) |
130 | { | 162 | { |
131 | const unsigned long poly = 0xedb88320; /* polynomial exclusive-or pattern */ | 163 | const unsigned int poly = 0xedb88320; /* polynomial exclusive-or pattern */ |
132 | unsigned short i; /* counter for all possible eight bit values */ | 164 | unsigned short i; /* counter for all possible eight bit values */ |
133 | 165 | ||
134 | /* initial shift register value */ | 166 | /* initial shift register value */ |
135 | crc = 0xffffffffL; | 167 | gunzip_crc = 0xffffffffL; |
136 | crc_table = (unsigned long *) malloc(256 * sizeof(unsigned long)); | 168 | gunzip_crc_table = (unsigned int *) malloc(256 * sizeof(unsigned int)); |
137 | 169 | ||
138 | /* Compute and print table of CRC's, five per line */ | 170 | /* Compute and print table of CRC's, five per line */ |
139 | for (i = 0; i < 256; i++) { | 171 | for (i = 0; i < 256; i++) { |
140 | unsigned long table_entry; /* crc shift register */ | 172 | unsigned int table_entry; /* crc shift register */ |
141 | char k; /* byte being shifted into crc apparatus */ | 173 | unsigned char k; /* byte being shifted into crc apparatus */ |
142 | 174 | ||
143 | table_entry = i; | 175 | table_entry = i; |
144 | /* The idea to initialize the register with the byte instead of | 176 | /* The idea to initialize the register with the byte instead of |
145 | * zero was stolen from Haruhiko Okumura's ar002 | 177 | * zero was stolen from Haruhiko Okumura's ar002 |
146 | */ | 178 | */ |
147 | for (k = 8; k; k--) { | 179 | for (k = 8; k; k--) { |
148 | table_entry = | 180 | if (table_entry & 1) { |
149 | table_entry & 1 ? (table_entry >> 1) ^ poly : table_entry >> | 181 | table_entry = (table_entry >> 1) ^ poly; |
150 | 1; | 182 | } else { |
151 | } | 183 | table_entry >>= 1; |
152 | crc_table[i] = table_entry; | ||
153 | } | 184 | } |
154 | } | ||
155 | |||
156 | /* =========================================================================== | ||
157 | * Write the output window window[0..outcnt-1] and update crc and bytes_out. | ||
158 | * (Used for the decompressed data only.) | ||
159 | */ | ||
160 | static void flush_window(void) | ||
161 | { | ||
162 | int n; | ||
163 | |||
164 | if (outcnt == 0) | ||
165 | return; | ||
166 | |||
167 | for (n = 0; n < outcnt; n++) { | ||
168 | crc = crc_table[((int) crc ^ (window[n])) & 0xff] ^ (crc >> 8); | ||
169 | } | 185 | } |
170 | 186 | gunzip_crc_table[i] = table_entry; | |
171 | if (fwrite(window, 1, outcnt, out_file) != outcnt) { | ||
172 | error_msg_and_die("Couldnt write"); | ||
173 | } | 187 | } |
174 | bytes_out += (unsigned long) outcnt; | ||
175 | outcnt = 0; | ||
176 | } | 188 | } |
177 | 189 | ||
178 | /* | 190 | /* |
@@ -183,7 +195,8 @@ static void flush_window(void) | |||
183 | */ | 195 | */ |
184 | static int huft_free(huft_t * t) | 196 | static int huft_free(huft_t * t) |
185 | { | 197 | { |
186 | huft_t *p, *q; | 198 | huft_t *p; |
199 | huft_t *q; | ||
187 | 200 | ||
188 | /* Go through linked list, freeing from the malloced (t[-1]) address. */ | 201 | /* Go through linked list, freeing from the malloced (t[-1]) address. */ |
189 | p = t; | 202 | p = t; |
@@ -195,8 +208,6 @@ static int huft_free(huft_t * t) | |||
195 | return 0; | 208 | return 0; |
196 | } | 209 | } |
197 | 210 | ||
198 | typedef unsigned char extra_bits_t; | ||
199 | |||
200 | /* Given a list of code lengths and a maximum table size, make a set of | 211 | /* Given a list of code lengths and a maximum table size, make a set of |
201 | * tables to decode that set of codes. Return zero on success, one if | 212 | * tables to decode that set of codes. Return zero on success, one if |
202 | * the given code set is incomplete (the tables are still built in this | 213 | * the given code set is incomplete (the tables are still built in this |
@@ -213,7 +224,7 @@ typedef unsigned char extra_bits_t; | |||
213 | */ | 224 | */ |
214 | static int huft_build(unsigned int *b, const unsigned int n, | 225 | static int huft_build(unsigned int *b, const unsigned int n, |
215 | const unsigned int s, const unsigned short *d, | 226 | const unsigned int s, const unsigned short *d, |
216 | const extra_bits_t * e, huft_t ** t, int *m) | 227 | const unsigned char *e, huft_t ** t, int *m) |
217 | { | 228 | { |
218 | unsigned a; /* counter for codes of length k */ | 229 | unsigned a; /* counter for codes of length k */ |
219 | unsigned c[BMAX + 1]; /* bit length count table */ | 230 | unsigned c[BMAX + 1]; /* bit length count table */ |
@@ -251,26 +262,35 @@ static int huft_build(unsigned int *b, const unsigned int n, | |||
251 | 262 | ||
252 | /* Find minimum and maximum length, bound *m by those */ | 263 | /* Find minimum and maximum length, bound *m by those */ |
253 | l = *m; | 264 | l = *m; |
254 | for (j = 1; j <= BMAX; j++) | 265 | for (j = 1; j <= BMAX; j++) { |
255 | if (c[j]) | 266 | if (c[j]) { |
256 | break; | 267 | break; |
268 | } | ||
269 | } | ||
257 | k = j; /* minimum code length */ | 270 | k = j; /* minimum code length */ |
258 | if ((unsigned) l < j) | 271 | if ((unsigned) l < j) { |
259 | l = j; | 272 | l = j; |
260 | for (i = BMAX; i; i--) | 273 | } |
261 | if (c[i]) | 274 | for (i = BMAX; i; i--) { |
275 | if (c[i]) { | ||
262 | break; | 276 | break; |
277 | } | ||
278 | } | ||
263 | g = i; /* maximum code length */ | 279 | g = i; /* maximum code length */ |
264 | if ((unsigned) l > i) | 280 | if ((unsigned) l > i) { |
265 | l = i; | 281 | l = i; |
282 | } | ||
266 | *m = l; | 283 | *m = l; |
267 | 284 | ||
268 | /* Adjust last length count to fill out codes, if needed */ | 285 | /* Adjust last length count to fill out codes, if needed */ |
269 | for (y = 1 << j; j < i; j++, y <<= 1) | 286 | for (y = 1 << j; j < i; j++, y <<= 1) { |
270 | if ((y -= c[j]) < 0) | 287 | if ((y -= c[j]) < 0) { |
271 | return 2; /* bad input: more codes than bits */ | 288 | return 2; /* bad input: more codes than bits */ |
272 | if ((y -= c[i]) < 0) | 289 | } |
290 | } | ||
291 | if ((y -= c[i]) < 0) { | ||
273 | return 2; | 292 | return 2; |
293 | } | ||
274 | c[i] += y; | 294 | c[i] += y; |
275 | 295 | ||
276 | /* Generate starting offsets into the value table for each length */ | 296 | /* Generate starting offsets into the value table for each length */ |
@@ -285,8 +305,9 @@ static int huft_build(unsigned int *b, const unsigned int n, | |||
285 | p = b; | 305 | p = b; |
286 | i = 0; | 306 | i = 0; |
287 | do { | 307 | do { |
288 | if ((j = *p++) != 0) | 308 | if ((j = *p++) != 0) { |
289 | v[x[j]++] = i; | 309 | v[x[j]++] = i; |
310 | } | ||
290 | } while (++i < n); | 311 | } while (++i < n); |
291 | 312 | ||
292 | /* Generate the Huffman codes and for each, make the table entries */ | 313 | /* Generate the Huffman codes and for each, make the table entries */ |
@@ -314,8 +335,9 @@ static int huft_build(unsigned int *b, const unsigned int n, | |||
314 | f -= a + 1; /* deduct codes from patterns left */ | 335 | f -= a + 1; /* deduct codes from patterns left */ |
315 | xp = c + k; | 336 | xp = c + k; |
316 | while (++j < z) { /* try smaller tables up to z bits */ | 337 | while (++j < z) { /* try smaller tables up to z bits */ |
317 | if ((f <<= 1) <= *++xp) | 338 | if ((f <<= 1) <= *++xp) { |
318 | break; /* enough codes to use up j bits */ | 339 | break; /* enough codes to use up j bits */ |
340 | } | ||
319 | f -= *xp; /* else deduct codes from patterns */ | 341 | f -= *xp; /* else deduct codes from patterns */ |
320 | } | 342 | } |
321 | } | 343 | } |
@@ -324,7 +346,7 @@ static int huft_build(unsigned int *b, const unsigned int n, | |||
324 | /* allocate and link in new table */ | 346 | /* allocate and link in new table */ |
325 | q = (huft_t *) xmalloc((z + 1) * sizeof(huft_t)); | 347 | q = (huft_t *) xmalloc((z + 1) * sizeof(huft_t)); |
326 | 348 | ||
327 | hufts += z + 1; /* track memory usage */ | 349 | gunzip_hufts += z + 1; /* track memory usage */ |
328 | *t = q + 1; /* link to list for huft_free() */ | 350 | *t = q + 1; /* link to list for huft_free() */ |
329 | *(t = &(q->v.t)) = NULL; | 351 | *(t = &(q->v.t)) = NULL; |
330 | u[h] = ++q; /* table starts after link */ | 352 | u[h] = ++q; /* table starts after link */ |
@@ -342,9 +364,9 @@ static int huft_build(unsigned int *b, const unsigned int n, | |||
342 | 364 | ||
343 | /* set up table entry in r */ | 365 | /* set up table entry in r */ |
344 | r.b = (unsigned char) (k - w); | 366 | r.b = (unsigned char) (k - w); |
345 | if (p >= v + n) | 367 | if (p >= v + n) { |
346 | r.e = 99; /* out of values--invalid code */ | 368 | r.e = 99; /* out of values--invalid code */ |
347 | else if (*p < s) { | 369 | } else if (*p < s) { |
348 | r.e = (unsigned char) (*p < 256 ? 16 : 15); /* 256 is end-of-block code */ | 370 | r.e = (unsigned char) (*p < 256 ? 16 : 15); /* 256 is end-of-block code */ |
349 | r.v.n = (unsigned short) (*p); /* simple code is just the value */ | 371 | r.v.n = (unsigned short) (*p); /* simple code is just the value */ |
350 | p++; /* one compiler does not like *p++ */ | 372 | p++; /* one compiler does not like *p++ */ |
@@ -355,12 +377,14 @@ static int huft_build(unsigned int *b, const unsigned int n, | |||
355 | 377 | ||
356 | /* fill code-like entries with r */ | 378 | /* fill code-like entries with r */ |
357 | f = 1 << (k - w); | 379 | f = 1 << (k - w); |
358 | for (j = i >> w; j < z; j += f) | 380 | for (j = i >> w; j < z; j += f) { |
359 | q[j] = r; | 381 | q[j] = r; |
382 | } | ||
360 | 383 | ||
361 | /* backwards increment the k-bit code i */ | 384 | /* backwards increment the k-bit code i */ |
362 | for (j = 1 << (k - 1); i & j; j >>= 1) | 385 | for (j = 1 << (k - 1); i & j; j >>= 1) { |
363 | i ^= j; | 386 | i ^= j; |
387 | } | ||
364 | i ^= j; | 388 | i ^= j; |
365 | 389 | ||
366 | /* backup over finished tables */ | 390 | /* backup over finished tables */ |
@@ -374,6 +398,25 @@ static int huft_build(unsigned int *b, const unsigned int n, | |||
374 | return y != 0 && g != 1; | 398 | return y != 0 && g != 1; |
375 | } | 399 | } |
376 | 400 | ||
401 | /* =========================================================================== | ||
402 | * Write the output gunzip_window gunzip_window[0..gunzip_outbuf_count-1] and update crc and gunzip_bytes_out. | ||
403 | * (Used for the decompressed data only.) | ||
404 | */ | ||
405 | static void flush_gunzip_window(void) | ||
406 | { | ||
407 | int n; | ||
408 | |||
409 | for (n = 0; n < gunzip_outbuf_count; n++) { | ||
410 | gunzip_crc = gunzip_crc_table[((int) gunzip_crc ^ (gunzip_window[n])) & 0xff] ^ (gunzip_crc >> 8); | ||
411 | } | ||
412 | |||
413 | if (write(gunzip_dst_fd, gunzip_window, gunzip_outbuf_count) != gunzip_outbuf_count) { | ||
414 | error_msg_and_die("Couldnt write"); | ||
415 | } | ||
416 | gunzip_bytes_out += gunzip_outbuf_count; | ||
417 | gunzip_outbuf_count = 0; | ||
418 | } | ||
419 | |||
377 | /* | 420 | /* |
378 | * inflate (decompress) the codes in a deflated (compressed) block. | 421 | * inflate (decompress) the codes in a deflated (compressed) block. |
379 | * Return an error code or zero if it all goes ok. | 422 | * Return an error code or zero if it all goes ok. |
@@ -381,32 +424,26 @@ static int huft_build(unsigned int *b, const unsigned int n, | |||
381 | * tl, td: literal/length and distance decoder tables | 424 | * tl, td: literal/length and distance decoder tables |
382 | * bl, bd: number of bits decoded by tl[] and td[] | 425 | * bl, bd: number of bits decoded by tl[] and td[] |
383 | */ | 426 | */ |
384 | static int inflate_codes(huft_t * tl, huft_t * td, int bl, int bd) | 427 | static int inflate_codes(huft_t * tl, huft_t * td, const unsigned int bl, const unsigned int bd) |
385 | { | 428 | { |
386 | register unsigned long e; /* table entry flag/number of extra bits */ | 429 | unsigned int e; /* table entry flag/number of extra bits */ |
387 | unsigned long n, d; /* length and index for copy */ | 430 | unsigned int n, d; /* length and index for copy */ |
388 | unsigned long w; /* current window position */ | 431 | unsigned int w; /* current gunzip_window position */ |
389 | huft_t *t; /* pointer to table entry */ | 432 | huft_t *t; /* pointer to table entry */ |
390 | unsigned ml, md; /* masks for bl and bd bits */ | 433 | unsigned int ml, md; /* masks for bl and bd bits */ |
391 | register unsigned long b; /* bit buffer */ | 434 | unsigned int b; /* bit buffer */ |
392 | register unsigned k; /* number of bits in bit buffer */ | 435 | unsigned int k; /* number of bits in bit buffer */ |
393 | register int input_char; | ||
394 | 436 | ||
395 | /* make local copies of globals */ | 437 | /* make local copies of globals */ |
396 | b = bb; /* initialize bit buffer */ | 438 | b = gunzip_bb; /* initialize bit buffer */ |
397 | k = bk; | 439 | k = gunzip_bk; |
398 | w = outcnt; /* initialize window position */ | 440 | w = gunzip_outbuf_count; /* initialize gunzip_window position */ |
399 | 441 | ||
400 | /* inflate the coded data */ | 442 | /* inflate the coded data */ |
401 | ml = mask_bits[bl]; /* precompute masks for speed */ | 443 | ml = mask_bits[bl]; /* precompute masks for speed */ |
402 | md = mask_bits[bd]; | 444 | md = mask_bits[bd]; |
403 | for (;;) { /* do until end of block */ | 445 | while (1) { /* do until end of block */ |
404 | while (k < (unsigned) bl) { | 446 | b = fill_bitbuffer(b, &k, bl); |
405 | input_char = fgetc(in_file); | ||
406 | if (input_char == EOF) return 1; | ||
407 | b |= ((unsigned long)input_char) << k; | ||
408 | k += 8; | ||
409 | } | ||
410 | if ((e = (t = tl + ((unsigned) b & ml))->e) > 16) | 447 | if ((e = (t = tl + ((unsigned) b & ml))->e) > 16) |
411 | do { | 448 | do { |
412 | if (e == 99) { | 449 | if (e == 99) { |
@@ -415,20 +452,16 @@ static int inflate_codes(huft_t * tl, huft_t * td, int bl, int bd) | |||
415 | b >>= t->b; | 452 | b >>= t->b; |
416 | k -= t->b; | 453 | k -= t->b; |
417 | e -= 16; | 454 | e -= 16; |
418 | while (k < e) { | 455 | b = fill_bitbuffer(b, &k, e); |
419 | input_char = fgetc(in_file); | ||
420 | if (input_char == EOF) return 1; | ||
421 | b |= ((unsigned long)input_char) << k; | ||
422 | k += 8; | ||
423 | } | ||
424 | } while ((e = | 456 | } while ((e = |
425 | (t = t->v.t + ((unsigned) b & mask_bits[e]))->e) > 16); | 457 | (t = t->v.t + ((unsigned) b & mask_bits[e]))->e) > 16); |
426 | b >>= t->b; | 458 | b >>= t->b; |
427 | k -= t->b; | 459 | k -= t->b; |
428 | if (e == 16) { /* then it's a literal */ | 460 | if (e == 16) { /* then it's a literal */ |
429 | window[w++] = (unsigned char) t->v.n; | 461 | gunzip_window[w++] = (unsigned char) t->v.n; |
430 | if (w == WSIZE) { | 462 | if (w == gunzip_wsize) { |
431 | outcnt = (w), flush_window(); | 463 | gunzip_outbuf_count = (w); |
464 | flush_gunzip_window(); | ||
432 | w = 0; | 465 | w = 0; |
433 | } | 466 | } |
434 | } else { /* it's an EOB or a length */ | 467 | } else { /* it's an EOB or a length */ |
@@ -439,24 +472,13 @@ static int inflate_codes(huft_t * tl, huft_t * td, int bl, int bd) | |||
439 | } | 472 | } |
440 | 473 | ||
441 | /* get length of block to copy */ | 474 | /* get length of block to copy */ |
442 | while (k < e) { | 475 | b = fill_bitbuffer(b, &k, e); |
443 | input_char = fgetc(in_file); | ||
444 | if (input_char == EOF) return 1; | ||
445 | b |= ((unsigned long)input_char) << k; | ||
446 | k += 8; | ||
447 | } | ||
448 | n = t->v.n + ((unsigned) b & mask_bits[e]); | 476 | n = t->v.n + ((unsigned) b & mask_bits[e]); |
449 | b >>= e; | 477 | b >>= e; |
450 | k -= e; | 478 | k -= e; |
451 | 479 | ||
452 | /* decode distance of block to copy */ | 480 | /* decode distance of block to copy */ |
453 | while (k < (unsigned) bd) { | 481 | b = fill_bitbuffer(b, &k, bd); |
454 | input_char = fgetc(in_file); | ||
455 | if (input_char == EOF) return 1; | ||
456 | b |= ((unsigned long)input_char) << k; | ||
457 | k += 8; | ||
458 | } | ||
459 | |||
460 | if ((e = (t = td + ((unsigned) b & md))->e) > 16) | 482 | if ((e = (t = td + ((unsigned) b & md))->e) > 16) |
461 | do { | 483 | do { |
462 | if (e == 99) | 484 | if (e == 99) |
@@ -464,23 +486,13 @@ static int inflate_codes(huft_t * tl, huft_t * td, int bl, int bd) | |||
464 | b >>= t->b; | 486 | b >>= t->b; |
465 | k -= t->b; | 487 | k -= t->b; |
466 | e -= 16; | 488 | e -= 16; |
467 | while (k < e) { | 489 | b = fill_bitbuffer(b, &k, e); |
468 | input_char = fgetc(in_file); | ||
469 | if (input_char == EOF) return 1; | ||
470 | b |= ((unsigned long)input_char) << k; | ||
471 | k += 8; | ||
472 | } | ||
473 | } while ((e = | 490 | } while ((e = |
474 | (t = | 491 | (t = |
475 | t->v.t + ((unsigned) b & mask_bits[e]))->e) > 16); | 492 | t->v.t + ((unsigned) b & mask_bits[e]))->e) > 16); |
476 | b >>= t->b; | 493 | b >>= t->b; |
477 | k -= t->b; | 494 | k -= t->b; |
478 | while (k < e) { | 495 | b = fill_bitbuffer(b, &k, e); |
479 | input_char = fgetc(in_file); | ||
480 | if (input_char == EOF) return 1; | ||
481 | b |= ((unsigned long)input_char) << k; | ||
482 | k += 8; | ||
483 | } | ||
484 | d = w - t->v.n - ((unsigned) b & mask_bits[e]); | 496 | d = w - t->v.n - ((unsigned) b & mask_bits[e]); |
485 | b >>= e; | 497 | b >>= e; |
486 | k -= e; | 498 | k -= e; |
@@ -489,60 +501,38 @@ static int inflate_codes(huft_t * tl, huft_t * td, int bl, int bd) | |||
489 | do { | 501 | do { |
490 | n -= (e = | 502 | n -= (e = |
491 | (e = | 503 | (e = |
492 | WSIZE - ((d &= WSIZE - 1) > w ? d : w)) > n ? n : e); | 504 | gunzip_wsize - ((d &= gunzip_wsize - 1) > w ? d : w)) > n ? n : e); |
493 | #if !defined(NOMEMCPY) && !defined(DEBUG) | 505 | /* copy to new buffer to prevent possible overwrite */ |
494 | if (w - d >= e) { /* (this test assumes unsigned comparison) */ | 506 | if (w - d >= e) { /* (this test assumes unsigned comparison) */ |
495 | memcpy(window + w, window + d, e); | 507 | memcpy(gunzip_window + w, gunzip_window + d, e); |
496 | w += e; | 508 | w += e; |
497 | d += e; | 509 | d += e; |
498 | } else /* do it slow to avoid memcpy() overlap */ | 510 | } else { |
499 | #endif /* !NOMEMCPY */ | 511 | /* do it slow to avoid memcpy() overlap */ |
512 | /* !NOMEMCPY */ | ||
500 | do { | 513 | do { |
501 | window[w++] = window[d++]; | 514 | gunzip_window[w++] = gunzip_window[d++]; |
502 | } while (--e); | 515 | } while (--e); |
503 | if (w == WSIZE) { | 516 | } |
504 | outcnt = (w), flush_window(); | 517 | if (w == gunzip_wsize) { |
518 | gunzip_outbuf_count = (w); | ||
519 | flush_gunzip_window(); | ||
505 | w = 0; | 520 | w = 0; |
506 | } | 521 | } |
522 | |||
507 | } while (n); | 523 | } while (n); |
508 | } | 524 | } |
509 | } | 525 | } |
510 | 526 | ||
511 | /* restore the globals from the locals */ | 527 | /* restore the globals from the locals */ |
512 | outcnt = w; /* restore global window pointer */ | 528 | gunzip_outbuf_count = w; /* restore global gunzip_window pointer */ |
513 | bb = b; /* restore global bit buffer */ | 529 | gunzip_bb = b; /* restore global bit buffer */ |
514 | bk = k; | 530 | gunzip_bk = k; |
515 | 531 | ||
516 | /* done */ | 532 | /* done */ |
517 | return 0; | 533 | return 0; |
518 | } | 534 | } |
519 | 535 | ||
520 | static const unsigned short cplens[] = { /* Copy lengths for literal codes 257..285 */ | ||
521 | 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, | ||
522 | 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0 | ||
523 | }; | ||
524 | |||
525 | /* note: see note #13 above about the 258 in this list. */ | ||
526 | static const extra_bits_t cplext[] = { /* Extra bits for literal codes 257..285 */ | ||
527 | 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, | ||
528 | 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 99, 99 | ||
529 | }; /* 99==invalid */ | ||
530 | static const unsigned short cpdist[] = { /* Copy offsets for distance codes 0..29 */ | ||
531 | 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, | ||
532 | 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, | ||
533 | 8193, 12289, 16385, 24577 | ||
534 | }; | ||
535 | static const extra_bits_t cpdext[] = { /* Extra bits for distance codes */ | ||
536 | 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, | ||
537 | 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, | ||
538 | 12, 12, 13, 13 | ||
539 | }; | ||
540 | |||
541 | /* Tables for deflate from PKZIP's appnote.txt. */ | ||
542 | static const extra_bits_t border[] = { /* Order of the bit length code lengths */ | ||
543 | 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 | ||
544 | }; | ||
545 | |||
546 | /* | 536 | /* |
547 | * decompress an inflated block | 537 | * decompress an inflated block |
548 | * e: last block flag | 538 | * e: last block flag |
@@ -552,53 +542,43 @@ static const extra_bits_t border[] = { /* Order of the bit length code lengths * | |||
552 | static int inflate_block(int *e) | 542 | static int inflate_block(int *e) |
553 | { | 543 | { |
554 | unsigned t; /* block type */ | 544 | unsigned t; /* block type */ |
555 | register unsigned long b; /* bit buffer */ | 545 | register unsigned int b; /* bit buffer */ |
556 | register unsigned k; /* number of bits in bit buffer */ | 546 | unsigned int k; /* number of bits in bit buffer */ |
557 | int input_char; | ||
558 | 547 | ||
559 | /* make local bit buffer */ | 548 | /* make local bit buffer */ |
560 | b = bb; | 549 | |
561 | k = bk; | 550 | b = gunzip_bb; |
551 | k = gunzip_bk; | ||
562 | 552 | ||
563 | /* read in last block bit */ | 553 | /* read in last block bit */ |
564 | while (k < 1) { | 554 | b = fill_bitbuffer(b, &k, 1); |
565 | input_char = fgetc(in_file); | ||
566 | if (input_char == EOF) return 1; | ||
567 | b |= ((unsigned long)input_char) << k; | ||
568 | k += 8; | ||
569 | } | ||
570 | *e = (int) b & 1; | 555 | *e = (int) b & 1; |
571 | b >>= 1; | 556 | b >>= 1; |
572 | k -= 1; | 557 | k -= 1; |
573 | 558 | ||
574 | /* read in block type */ | 559 | /* read in block type */ |
575 | while (k < 2) { | 560 | b = fill_bitbuffer(b, &k, 2); |
576 | input_char = fgetc(in_file); | ||
577 | if (input_char == EOF) return 1; | ||
578 | b |= ((unsigned long)input_char) << k; | ||
579 | k += 8; | ||
580 | } | ||
581 | t = (unsigned) b & 3; | 561 | t = (unsigned) b & 3; |
582 | b >>= 2; | 562 | b >>= 2; |
583 | k -= 2; | 563 | k -= 2; |
584 | 564 | ||
585 | /* restore the global bit buffer */ | 565 | /* restore the global bit buffer */ |
586 | bb = b; | 566 | gunzip_bb = b; |
587 | bk = k; | 567 | gunzip_bk = k; |
588 | 568 | ||
589 | /* inflate that block type */ | 569 | /* inflate that block type */ |
590 | switch (t) { | 570 | switch (t) { |
591 | case 0: /* Inflate stored */ | 571 | case 0: /* Inflate stored */ |
592 | { | 572 | { |
593 | unsigned long n; /* number of bytes in block */ | 573 | unsigned int n; /* number of bytes in block */ |
594 | unsigned long w; /* current window position */ | 574 | unsigned int w; /* current gunzip_window position */ |
595 | register unsigned long b_stored; /* bit buffer */ | 575 | unsigned int b_stored; /* bit buffer */ |
596 | register unsigned long k_stored; /* number of bits in bit buffer */ | 576 | unsigned int k_stored; /* number of bits in bit buffer */ |
597 | 577 | ||
598 | /* make local copies of globals */ | 578 | /* make local copies of globals */ |
599 | b_stored = bb; /* initialize bit buffer */ | 579 | b_stored = gunzip_bb; /* initialize bit buffer */ |
600 | k_stored = bk; | 580 | k_stored = gunzip_bk; |
601 | w = outcnt; /* initialize window position */ | 581 | w = gunzip_outbuf_count; /* initialize gunzip_window position */ |
602 | 582 | ||
603 | /* go to byte boundary */ | 583 | /* go to byte boundary */ |
604 | n = k_stored & 7; | 584 | n = k_stored & 7; |
@@ -606,21 +586,12 @@ static int inflate_block(int *e) | |||
606 | k_stored -= n; | 586 | k_stored -= n; |
607 | 587 | ||
608 | /* get the length and its complement */ | 588 | /* get the length and its complement */ |
609 | while (k_stored < 16) { | 589 | b_stored = fill_bitbuffer(b_stored, &k_stored, 16); |
610 | input_char = fgetc(in_file); | ||
611 | if (input_char == EOF) return 1; | ||
612 | b_stored |= ((unsigned long)input_char) << k_stored; | ||
613 | k_stored += 8; | ||
614 | } | ||
615 | n = ((unsigned) b_stored & 0xffff); | 590 | n = ((unsigned) b_stored & 0xffff); |
616 | b_stored >>= 16; | 591 | b_stored >>= 16; |
617 | k_stored -= 16; | 592 | k_stored -= 16; |
618 | while (k_stored < 16) { | 593 | |
619 | input_char = fgetc(in_file); | 594 | b_stored = fill_bitbuffer(b_stored, &k_stored, 16); |
620 | if (input_char == EOF) return 1; | ||
621 | b_stored |= ((unsigned long)input_char) << k_stored; | ||
622 | k_stored += 8; | ||
623 | } | ||
624 | if (n != (unsigned) ((~b_stored) & 0xffff)) { | 595 | if (n != (unsigned) ((~b_stored) & 0xffff)) { |
625 | return 1; /* error in compressed data */ | 596 | return 1; /* error in compressed data */ |
626 | } | 597 | } |
@@ -629,15 +600,11 @@ static int inflate_block(int *e) | |||
629 | 600 | ||
630 | /* read and output the compressed data */ | 601 | /* read and output the compressed data */ |
631 | while (n--) { | 602 | while (n--) { |
632 | while (k_stored < 8) { | 603 | b_stored = fill_bitbuffer(b_stored, &k_stored, 8); |
633 | input_char = fgetc(in_file); | 604 | gunzip_window[w++] = (unsigned char) b_stored; |
634 | if (input_char == EOF) return 1; | 605 | if (w == (unsigned int) gunzip_wsize) { |
635 | b_stored |= ((unsigned long)input_char) << k_stored; | 606 | gunzip_outbuf_count = (w); |
636 | k_stored += 8; | 607 | flush_gunzip_window(); |
637 | } | ||
638 | window[w++] = (unsigned char) b_stored; | ||
639 | if (w == (unsigned long) WSIZE) { | ||
640 | outcnt = (w), flush_window(); | ||
641 | w = 0; | 608 | w = 0; |
642 | } | 609 | } |
643 | b_stored >>= 8; | 610 | b_stored >>= 8; |
@@ -645,9 +612,9 @@ static int inflate_block(int *e) | |||
645 | } | 612 | } |
646 | 613 | ||
647 | /* restore the globals from the locals */ | 614 | /* restore the globals from the locals */ |
648 | outcnt = w; /* restore global window pointer */ | 615 | gunzip_outbuf_count = w; /* restore global gunzip_window pointer */ |
649 | bb = b_stored; /* restore global bit buffer */ | 616 | gunzip_bb = b_stored; /* restore global bit buffer */ |
650 | bk = k_stored; | 617 | gunzip_bk = k_stored; |
651 | return 0; | 618 | return 0; |
652 | } | 619 | } |
653 | case 1: /* Inflate fixed | 620 | case 1: /* Inflate fixed |
@@ -659,8 +626,8 @@ static int inflate_block(int *e) | |||
659 | int i; /* temporary variable */ | 626 | int i; /* temporary variable */ |
660 | huft_t *tl; /* literal/length code table */ | 627 | huft_t *tl; /* literal/length code table */ |
661 | huft_t *td; /* distance code table */ | 628 | huft_t *td; /* distance code table */ |
662 | int bl; /* lookup bits for tl */ | 629 | unsigned int bl; /* lookup bits for tl */ |
663 | int bd; /* lookup bits for td */ | 630 | unsigned int bd; /* lookup bits for td */ |
664 | unsigned int l[288]; /* length list for huft_build */ | 631 | unsigned int l[288]; /* length list for huft_build */ |
665 | 632 | ||
666 | /* set up literal table */ | 633 | /* set up literal table */ |
@@ -692,8 +659,9 @@ static int inflate_block(int *e) | |||
692 | } | 659 | } |
693 | 660 | ||
694 | /* decompress until an end-of-block code */ | 661 | /* decompress until an end-of-block code */ |
695 | if (inflate_codes(tl, td, bl, bd)) | 662 | if (inflate_codes(tl, td, bl, bd)) { |
696 | return 1; | 663 | return 1; |
664 | } | ||
697 | 665 | ||
698 | /* free the decoding tables, return */ | 666 | /* free the decoding tables, return */ |
699 | huft_free(tl); | 667 | huft_free(tl); |
@@ -705,53 +673,41 @@ static int inflate_block(int *e) | |||
705 | const int dbits = 6; /* bits in base distance lookup table */ | 673 | const int dbits = 6; /* bits in base distance lookup table */ |
706 | const int lbits = 9; /* bits in base literal/length lookup table */ | 674 | const int lbits = 9; /* bits in base literal/length lookup table */ |
707 | 675 | ||
708 | int i; /* temporary variables */ | ||
709 | unsigned j; | ||
710 | unsigned l; /* last length */ | ||
711 | unsigned m; /* mask for bit lengths table */ | ||
712 | unsigned n; /* number of lengths to get */ | ||
713 | huft_t *tl; /* literal/length code table */ | 676 | huft_t *tl; /* literal/length code table */ |
714 | huft_t *td; /* distance code table */ | 677 | huft_t *td; /* distance code table */ |
715 | int bl; /* lookup bits for tl */ | 678 | unsigned int i; /* temporary variables */ |
716 | int bd; /* lookup bits for td */ | 679 | unsigned int j; |
717 | unsigned nb; /* number of bit length codes */ | 680 | unsigned int l; /* last length */ |
718 | unsigned nl; /* number of literal/length codes */ | 681 | unsigned int m; /* mask for bit lengths table */ |
719 | unsigned nd; /* number of distance codes */ | 682 | unsigned int n; /* number of lengths to get */ |
720 | 683 | unsigned int bl; /* lookup bits for tl */ | |
721 | unsigned ll[286 + 30]; /* literal/length and distance code lengths */ | 684 | unsigned int bd; /* lookup bits for td */ |
722 | register unsigned long b_dynamic; /* bit buffer */ | 685 | unsigned int nb; /* number of bit length codes */ |
723 | register unsigned k_dynamic; /* number of bits in bit buffer */ | 686 | unsigned int nl; /* number of literal/length codes */ |
687 | unsigned int nd; /* number of distance codes */ | ||
688 | |||
689 | unsigned int ll[286 + 30]; /* literal/length and distance code lengths */ | ||
690 | unsigned int b_dynamic; /* bit buffer */ | ||
691 | unsigned int k_dynamic; /* number of bits in bit buffer */ | ||
724 | 692 | ||
725 | /* make local bit buffer */ | 693 | /* make local bit buffer */ |
726 | b_dynamic = bb; | 694 | b_dynamic = gunzip_bb; |
727 | k_dynamic = bk; | 695 | k_dynamic = gunzip_bk; |
728 | 696 | ||
729 | /* read in table lengths */ | 697 | /* read in table lengths */ |
730 | while (k_dynamic < 5) { | 698 | b_dynamic = fill_bitbuffer(b_dynamic, &k_dynamic, 5); |
731 | input_char = fgetc(in_file); | 699 | nl = 257 + ((unsigned int) b_dynamic & 0x1f); /* number of literal/length codes */ |
732 | if (input_char == EOF) return 1; | 700 | |
733 | b_dynamic |= ((unsigned long)input_char) << k_dynamic; | ||
734 | k_dynamic += 8; | ||
735 | } | ||
736 | nl = 257 + ((unsigned) b_dynamic & 0x1f); /* number of literal/length codes */ | ||
737 | b_dynamic >>= 5; | 701 | b_dynamic >>= 5; |
738 | k_dynamic -= 5; | 702 | k_dynamic -= 5; |
739 | while (k_dynamic < 5) { | 703 | b_dynamic = fill_bitbuffer(b_dynamic, &k_dynamic, 5); |
740 | input_char = fgetc(in_file); | 704 | nd = 1 + ((unsigned int) b_dynamic & 0x1f); /* number of distance codes */ |
741 | if (input_char == EOF) return 1; | 705 | |
742 | b_dynamic |= ((unsigned long)input_char) << k_dynamic; | ||
743 | k_dynamic += 8; | ||
744 | } | ||
745 | nd = 1 + ((unsigned) b_dynamic & 0x1f); /* number of distance codes */ | ||
746 | b_dynamic >>= 5; | 706 | b_dynamic >>= 5; |
747 | k_dynamic -= 5; | 707 | k_dynamic -= 5; |
748 | while (k_dynamic < 4) { | 708 | b_dynamic = fill_bitbuffer(b_dynamic, &k_dynamic, 4); |
749 | input_char = fgetc(in_file); | 709 | nb = 4 + ((unsigned int) b_dynamic & 0xf); /* number of bit length codes */ |
750 | if (input_char == EOF) return 1; | 710 | |
751 | b_dynamic |= ((unsigned long)input_char) << k_dynamic; | ||
752 | k_dynamic += 8; | ||
753 | } | ||
754 | nb = 4 + ((unsigned) b_dynamic & 0xf); /* number of bit length codes */ | ||
755 | b_dynamic >>= 4; | 711 | b_dynamic >>= 4; |
756 | k_dynamic -= 4; | 712 | k_dynamic -= 4; |
757 | if (nl > 286 || nd > 30) { | 713 | if (nl > 286 || nd > 30) { |
@@ -760,13 +716,8 @@ static int inflate_block(int *e) | |||
760 | 716 | ||
761 | /* read in bit-length-code lengths */ | 717 | /* read in bit-length-code lengths */ |
762 | for (j = 0; j < nb; j++) { | 718 | for (j = 0; j < nb; j++) { |
763 | while (k_dynamic < 3) { | 719 | b_dynamic = fill_bitbuffer(b_dynamic, &k_dynamic, 3); |
764 | input_char = fgetc(in_file); | 720 | ll[border[j]] = (unsigned int) b_dynamic & 7; |
765 | if (input_char == EOF) return 1; | ||
766 | b_dynamic |= ((unsigned long)input_char) << k_dynamic; | ||
767 | k_dynamic += 8; | ||
768 | } | ||
769 | ll[border[j]] = (unsigned) b_dynamic & 7; | ||
770 | b_dynamic >>= 3; | 721 | b_dynamic >>= 3; |
771 | k_dynamic -= 3; | 722 | k_dynamic -= 3; |
772 | } | 723 | } |
@@ -776,7 +727,8 @@ static int inflate_block(int *e) | |||
776 | 727 | ||
777 | /* build decoding table for trees--single level, 7 bit lookup */ | 728 | /* build decoding table for trees--single level, 7 bit lookup */ |
778 | bl = 7; | 729 | bl = 7; |
779 | if ((i = huft_build(ll, 19, 19, NULL, NULL, &tl, &bl)) != 0) { | 730 | i = huft_build(ll, 19, 19, NULL, NULL, &tl, &bl); |
731 | if (i != 0) { | ||
780 | if (i == 1) { | 732 | if (i == 1) { |
781 | huft_free(tl); | 733 | huft_free(tl); |
782 | } | 734 | } |
@@ -787,46 +739,31 @@ static int inflate_block(int *e) | |||
787 | n = nl + nd; | 739 | n = nl + nd; |
788 | m = mask_bits[bl]; | 740 | m = mask_bits[bl]; |
789 | i = l = 0; | 741 | i = l = 0; |
790 | while ((unsigned) i < n) { | 742 | while ((unsigned int) i < n) { |
791 | while (k_dynamic < (unsigned) bl) { | 743 | b_dynamic = fill_bitbuffer(b_dynamic, &k_dynamic, (unsigned int)bl); |
792 | input_char = fgetc(in_file); | 744 | j = (td = tl + ((unsigned int) b_dynamic & m))->b; |
793 | if (input_char == EOF) return 1; | ||
794 | b_dynamic |= ((unsigned long)input_char) << k_dynamic; | ||
795 | k_dynamic += 8; | ||
796 | } | ||
797 | j = (td = tl + ((unsigned) b_dynamic & m))->b; | ||
798 | b_dynamic >>= j; | 745 | b_dynamic >>= j; |
799 | k_dynamic -= j; | 746 | k_dynamic -= j; |
800 | j = td->v.n; | 747 | j = td->v.n; |
801 | if (j < 16) { /* length of code in bits (0..15) */ | 748 | if (j < 16) { /* length of code in bits (0..15) */ |
802 | ll[i++] = l = j; /* save last length in l */ | 749 | ll[i++] = l = j; /* save last length in l */ |
803 | } else if (j == 16) { /* repeat last length 3 to 6 times */ | 750 | } else if (j == 16) { /* repeat last length 3 to 6 times */ |
804 | while (k_dynamic < 2) { | 751 | b_dynamic = fill_bitbuffer(b_dynamic, &k_dynamic, 2); |
805 | input_char = fgetc(in_file); | 752 | j = 3 + ((unsigned int) b_dynamic & 3); |
806 | if (input_char == EOF) return 1; | ||
807 | b_dynamic |= ((unsigned long)input_char) << k_dynamic; | ||
808 | k_dynamic += 8; | ||
809 | } | ||
810 | j = 3 + ((unsigned) b_dynamic & 3); | ||
811 | b_dynamic >>= 2; | 753 | b_dynamic >>= 2; |
812 | k_dynamic -= 2; | 754 | k_dynamic -= 2; |
813 | if ((unsigned) i + j > n) { | 755 | if ((unsigned int) i + j > n) { |
814 | return 1; | 756 | return 1; |
815 | } | 757 | } |
816 | while (j--) { | 758 | while (j--) { |
817 | ll[i++] = l; | 759 | ll[i++] = l; |
818 | } | 760 | } |
819 | } else if (j == 17) { /* 3 to 10 zero length codes */ | 761 | } else if (j == 17) { /* 3 to 10 zero length codes */ |
820 | while (k_dynamic < 3) { | 762 | b_dynamic = fill_bitbuffer(b_dynamic, &k_dynamic, 3); |
821 | input_char = fgetc(in_file); | 763 | j = 3 + ((unsigned int) b_dynamic & 7); |
822 | if (input_char == EOF) return 1; | ||
823 | b_dynamic |= ((unsigned long)input_char) << k_dynamic; | ||
824 | k_dynamic += 8; | ||
825 | } | ||
826 | j = 3 + ((unsigned) b_dynamic & 7); | ||
827 | b_dynamic >>= 3; | 764 | b_dynamic >>= 3; |
828 | k_dynamic -= 3; | 765 | k_dynamic -= 3; |
829 | if ((unsigned) i + j > n) { | 766 | if ((unsigned int) i + j > n) { |
830 | return 1; | 767 | return 1; |
831 | } | 768 | } |
832 | while (j--) { | 769 | while (j--) { |
@@ -834,16 +771,11 @@ static int inflate_block(int *e) | |||
834 | } | 771 | } |
835 | l = 0; | 772 | l = 0; |
836 | } else { /* j == 18: 11 to 138 zero length codes */ | 773 | } else { /* j == 18: 11 to 138 zero length codes */ |
837 | while (k_dynamic < 7) { | 774 | b_dynamic = fill_bitbuffer(b_dynamic, &k_dynamic, 7); |
838 | input_char = fgetc(in_file); | 775 | j = 11 + ((unsigned int) b_dynamic & 0x7f); |
839 | if (input_char == EOF) return 1; | ||
840 | b_dynamic |= ((unsigned long)input_char) << k_dynamic; | ||
841 | k_dynamic += 8; | ||
842 | } | ||
843 | j = 11 + ((unsigned) b_dynamic & 0x7f); | ||
844 | b_dynamic >>= 7; | 776 | b_dynamic >>= 7; |
845 | k_dynamic -= 7; | 777 | k_dynamic -= 7; |
846 | if ((unsigned) i + j > n) { | 778 | if ((unsigned int) i + j > n) { |
847 | return 1; | 779 | return 1; |
848 | } | 780 | } |
849 | while (j--) { | 781 | while (j--) { |
@@ -857,22 +789,24 @@ static int inflate_block(int *e) | |||
857 | huft_free(tl); | 789 | huft_free(tl); |
858 | 790 | ||
859 | /* restore the global bit buffer */ | 791 | /* restore the global bit buffer */ |
860 | bb = b_dynamic; | 792 | gunzip_bb = b_dynamic; |
861 | bk = k_dynamic; | 793 | gunzip_bk = k_dynamic; |
862 | 794 | ||
863 | /* build the decoding tables for literal/length and distance codes */ | 795 | /* build the decoding tables for literal/length and distance codes */ |
864 | bl = lbits; | 796 | bl = lbits; |
797 | |||
865 | if ((i = huft_build(ll, nl, 257, cplens, cplext, &tl, &bl)) != 0) { | 798 | if ((i = huft_build(ll, nl, 257, cplens, cplext, &tl, &bl)) != 0) { |
866 | if (i == 1) { | 799 | if (i == 1) { |
867 | error_msg("Incomplete literal tree"); | 800 | error_msg_and_die("Incomplete literal tree"); |
868 | huft_free(tl); | 801 | huft_free(tl); |
869 | } | 802 | } |
870 | return i; /* incomplete code set */ | 803 | return i; /* incomplete code set */ |
871 | } | 804 | } |
805 | |||
872 | bd = dbits; | 806 | bd = dbits; |
873 | if ((i = huft_build(ll + nl, nd, 0, cpdist, cpdext, &td, &bd)) != 0) { | 807 | if ((i = huft_build(ll + nl, nd, 0, cpdist, cpdext, &td, &bd)) != 0) { |
874 | if (i == 1) { | 808 | if (i == 1) { |
875 | error_msg("incomplete distance tree"); | 809 | error_msg_and_die("incomplete distance tree"); |
876 | huft_free(td); | 810 | huft_free(td); |
877 | } | 811 | } |
878 | huft_free(tl); | 812 | huft_free(tl); |
@@ -880,8 +814,9 @@ static int inflate_block(int *e) | |||
880 | } | 814 | } |
881 | 815 | ||
882 | /* decompress until an end-of-block code */ | 816 | /* decompress until an end-of-block code */ |
883 | if (inflate_codes(tl, td, bl, bd)) | 817 | if (inflate_codes(tl, td, bl, bd)) { |
884 | return 1; | 818 | return 1; |
819 | } | ||
885 | 820 | ||
886 | /* free the decoding tables, return */ | 821 | /* free the decoding tables, return */ |
887 | huft_free(tl); | 822 | huft_free(tl); |
@@ -890,6 +825,7 @@ static int inflate_block(int *e) | |||
890 | } | 825 | } |
891 | default: | 826 | default: |
892 | /* bad block type */ | 827 | /* bad block type */ |
828 | error_msg("bad block type %d\n", t); | ||
893 | return 2; | 829 | return 2; |
894 | } | 830 | } |
895 | } | 831 | } |
@@ -897,72 +833,24 @@ static int inflate_block(int *e) | |||
897 | /* | 833 | /* |
898 | * decompress an inflated entry | 834 | * decompress an inflated entry |
899 | * | 835 | * |
900 | * GLOBAL VARIABLES: outcnt, bk, bb, hufts, inptr | 836 | * GLOBAL VARIABLES: gunzip_outbuf_count, bk, gunzip_bb, hufts, inptr |
901 | */ | 837 | */ |
902 | extern int inflate(FILE * in, FILE * out) | 838 | extern int inflate(int in, int out) |
903 | { | 839 | { |
840 | typedef void (*sig_type) (int); | ||
904 | int e; /* last block flag */ | 841 | int e; /* last block flag */ |
905 | int r; /* result code */ | 842 | int r; /* result code */ |
906 | unsigned h = 0; /* maximum struct huft's malloc'ed */ | 843 | unsigned h = 0; /* maximum struct huft's malloc'ed */ |
907 | 844 | ||
908 | /* initialize window, bit buffer */ | ||
909 | outcnt = 0; | ||
910 | bk = 0; | ||
911 | bb = 0; | ||
912 | |||
913 | in_file = in; | ||
914 | out_file = out; | ||
915 | |||
916 | /* Allocate all global buffers (for DYN_ALLOC option) */ | 845 | /* Allocate all global buffers (for DYN_ALLOC option) */ |
917 | window = xmalloc((size_t) (((2L * WSIZE) + 1L) * sizeof(unsigned char))); | 846 | gunzip_window = xmalloc(0x8000); |
918 | bytes_out = 0L; | 847 | gunzip_outbuf_count = 0; |
848 | gunzip_bytes_out = 0; | ||
919 | 849 | ||
920 | /* Create the crc table */ | 850 | gunzip_src_fd = in; |
921 | make_crc_table(); | 851 | gunzip_dst_fd = out; |
922 | 852 | ||
923 | /* decompress until the last block */ | 853 | gunzip_in_buffer = malloc(8); |
924 | do { | ||
925 | hufts = 0; | ||
926 | if ((r = inflate_block(&e)) != 0) { | ||
927 | return r; | ||
928 | } | ||
929 | if (hufts > h) { | ||
930 | h = hufts; | ||
931 | } | ||
932 | } while (!e); | ||
933 | |||
934 | /* Undo too much lookahead. The next read will be byte aligned so we | ||
935 | * can discard unused bits in the last meaningful byte. | ||
936 | */ | ||
937 | while (bk >= 8) { | ||
938 | bk -= 8; | ||
939 | ungetc((bb << bk), in_file); | ||
940 | } | ||
941 | |||
942 | /* flush out window */ | ||
943 | flush_window(); | ||
944 | free(window); | ||
945 | free(crc_table); | ||
946 | |||
947 | /* return success */ | ||
948 | return 0; | ||
949 | } | ||
950 | |||
951 | /* =========================================================================== | ||
952 | * Unzip in to out. This routine works on gzip files only. | ||
953 | * | ||
954 | * IN assertions: the buffer inbuf contains already the beginning of | ||
955 | * the compressed data, from offsets inptr to insize-1 included. | ||
956 | * The magic header has already been checked. The output buffer is cleared. | ||
957 | * in, out: input and output file descriptors | ||
958 | */ | ||
959 | extern int unzip(FILE * l_in_file, FILE * l_out_file) | ||
960 | { | ||
961 | unsigned char buf[8]; /* extended local header */ | ||
962 | unsigned char flags; /* compression flags */ | ||
963 | typedef void (*sig_type) (int); | ||
964 | unsigned short i; | ||
965 | unsigned char magic[2]; | ||
966 | 854 | ||
967 | if (signal(SIGINT, SIG_IGN) != SIG_IGN) { | 855 | if (signal(SIGINT, SIG_IGN) != SIG_IGN) { |
968 | (void) signal(SIGINT, (sig_type) abort_gzip); | 856 | (void) signal(SIGINT, (sig_type) abort_gzip); |
@@ -973,97 +861,44 @@ extern int unzip(FILE * l_in_file, FILE * l_out_file) | |||
973 | } | 861 | } |
974 | #endif | 862 | #endif |
975 | 863 | ||
976 | magic[0] = fgetc(l_in_file); | 864 | /* initialize gunzip_window, bit buffer */ |
977 | magic[1] = fgetc(l_in_file); | 865 | gunzip_bk = 0; |
978 | 866 | gunzip_bb = 0; | |
979 | #ifdef CONFIG_FEATURE_UNCOMPRESS | ||
980 | /* Magic header for compress files, 1F 9d = \037\235 */ | ||
981 | if ((magic[0] == 0x1F) && (magic[1] == 0x9d)) { | ||
982 | return uncompress(l_in_file, l_out_file); | ||
983 | } | ||
984 | #endif | ||
985 | |||
986 | /* Magic header for gzip files, 1F 8B = \037\213 */ | ||
987 | if ((magic[0] != 0x1F) || (magic[1] != 0x8b)) { | ||
988 | error_msg("Invalid gzip magic"); | ||
989 | return EXIT_FAILURE; | ||
990 | } | ||
991 | |||
992 | /* Check the compression method */ | ||
993 | if (fgetc(l_in_file) != 8) /* also catches EOF */ { | ||
994 | error_msg("Unknown compression method"); | ||
995 | return (-1); | ||
996 | } | ||
997 | |||
998 | flags = (unsigned char) fgetc(l_in_file); | ||
999 | |||
1000 | /* Ignore time stamp(4), extra flags(1), OS type(1) */ | ||
1001 | for (i = 0; i < 6; i++) { | ||
1002 | fgetc(l_in_file); | ||
1003 | } | ||
1004 | 867 | ||
1005 | if (flags & 0x04) { | 868 | /* Create the crc table */ |
1006 | /* bit 2 set: extra field present */ | 869 | make_gunzip_crc_table(); |
1007 | const unsigned short extra = | ||
1008 | fgetc(l_in_file) + (fgetc(l_in_file) << 8); | ||
1009 | if (feof(in_file)) return 1; | ||
1010 | for (i = 0; i < extra; i++) { | ||
1011 | fgetc(l_in_file); | ||
1012 | } | ||
1013 | } | ||
1014 | |||
1015 | /* Discard original name if any */ | ||
1016 | if (flags & 0x08) { | ||
1017 | /* bit 3 set: original file name present */ | ||
1018 | while (fgetc(l_in_file) != 0 && !feof(l_in_file)); /* null */ | ||
1019 | } | ||
1020 | 870 | ||
1021 | /* Discard file comment if any */ | 871 | /* decompress until the last block */ |
1022 | if (flags & 0x10) { | 872 | do { |
1023 | /* bit 4 set: file comment present */ | 873 | gunzip_hufts = 0; |
1024 | while (fgetc(l_in_file) != 0 && !feof(l_in_file)); /* null */ | 874 | r = inflate_block(&e); |
875 | if (r != 0) { | ||
876 | error_msg_and_die("inflate error %d", r); | ||
877 | return r; | ||
1025 | } | 878 | } |
1026 | 879 | if (gunzip_hufts > h) { | |
1027 | /* Decompress */ | 880 | h = gunzip_hufts; |
1028 | if (inflate(l_in_file, l_out_file) != 0) { | ||
1029 | error_msg("invalid compressed data--format violated"); | ||
1030 | } | 881 | } |
882 | } while (!e); | ||
1031 | 883 | ||
1032 | /* Get the crc and original length | 884 | /* write any buffered uncompressed data */ |
1033 | * crc32 (see algorithm.doc) | 885 | flush_gunzip_window(); |
1034 | * uncompressed input size modulo 2^32 | 886 | free(gunzip_window); |
1035 | */ | 887 | |
1036 | fread(buf, 1, 8, l_in_file); | 888 | /* Cleanup */ |
1037 | 889 | free(gunzip_crc_table); | |
1038 | /* Validate decompression - crc */ | 890 | |
1039 | if ((unsigned int) ((buf[0] | (buf[1] << 8)) | | 891 | /* Store unused bytes in a global buffer so calling applets can access it */ |
1040 | ((buf[2] | (buf[3] << 8)) << 16)) != | 892 | gunzip_in_buffer_count = 0; |
1041 | (crc ^ 0xffffffffL)) { | 893 | if (gunzip_bk >= 8) { |
1042 | error_msg("invalid compressed data--crc error"); | 894 | /* Undo too much lookahead. The next read will be byte aligned |
1043 | } | 895 | * so we can discard unused bits in the last meaningful byte. */ |
1044 | /* Validate decompression - size */ | 896 | gunzip_in_buffer[gunzip_in_buffer_count] = gunzip_bb & 0xff; |
1045 | if (((buf[4] | (buf[5] << 8)) | ((buf[6] | (buf[7] << 8)) << 16)) != | 897 | gunzip_in_buffer_count++; |
1046 | (unsigned long) bytes_out) { | 898 | gunzip_bb >>= 8; |
1047 | error_msg("invalid compressed data--length error"); | 899 | gunzip_bk -= 8; |
1048 | } | 900 | } |
1049 | 901 | ||
902 | /* return success */ | ||
1050 | return 0; | 903 | return 0; |
1051 | } | 904 | } |
1052 | |||
1053 | /* | ||
1054 | * This needs access to global variables window and crc_table, so its not in its own file. | ||
1055 | */ | ||
1056 | extern void gz_close(int gunzip_pid) | ||
1057 | { | ||
1058 | if (kill(gunzip_pid, SIGTERM) == -1) { | ||
1059 | error_msg_and_die | ||
1060 | ("*** Couldnt kill old gunzip process *** aborting"); | ||
1061 | } | ||
1062 | |||
1063 | if (waitpid(gunzip_pid, NULL, 0) == -1) { | ||
1064 | printf("Couldnt wait ?"); | ||
1065 | } | ||
1066 | |||
1067 | free(window); | ||
1068 | free(crc_table); | ||
1069 | } | ||