2 * Copyright (c) 2012 Michihiro NAKAJIMA
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR
15 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
17 * IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
18 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
19 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
20 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
21 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
23 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 #include "bsdtar_platform.h"
27 __FBSDID("$FreeBSD$");
42 int program; /* Set 1 if filter is a program name */
48 struct suffix_code_t {
54 get_suffix_code(const struct suffix_code_t *tbl, const char *suffix)
60 for (i = 0; tbl[i].suffix != NULL; i++) {
61 if (strcmp(tbl[i].suffix, suffix) == 0)
68 get_filter_code(const char *suffix)
70 /* A pair of suffix and compression/filter. */
71 static const struct suffix_code_t filters[] = {
81 { ".uu", "uuencode" },
87 return get_suffix_code(filters, suffix);
91 get_format_code(const char *suffix)
93 /* A pair of suffix and format. */
94 static const struct suffix_code_t formats[] = {
98 { ".iso", "iso9960" },
99 { ".mtree", "mtree" },
108 return get_suffix_code(formats, suffix);
112 decompose_alias(const char *suffix)
114 static const struct suffix_code_t alias[] = {
115 { ".taz", ".tar.gz" },
116 { ".tgz", ".tar.gz" },
117 { ".tbz", ".tar.bz2" },
118 { ".tbz2", ".tar.bz2" },
119 { ".tz2", ".tar.bz2" },
120 { ".tlz", ".tar.lzma" },
121 { ".txz", ".tar.xz" },
122 { ".tzo", ".tar.lzo" },
123 { ".taZ", ".tar.Z" },
125 { ".tzst", ".tar.zst" },
129 return get_suffix_code(alias, suffix);
133 _cset_add_filter(struct creation_set *cset, int program, const char *filter)
135 struct filter_set *new_ptr;
138 new_ptr = (struct filter_set *)realloc(cset->filters,
139 sizeof(*cset->filters) * (cset->filter_count + 1));
141 lafe_errc(1, 0, "No memory");
142 new_filter = strdup(filter);
143 if (new_filter == NULL)
144 lafe_errc(1, 0, "No memory");
145 cset->filters = new_ptr;
146 cset->filters[cset->filter_count].program = program;
147 cset->filters[cset->filter_count].filter_name = new_filter;
148 cset->filter_count++;
152 cset_add_filter(struct creation_set *cset, const char *filter)
154 _cset_add_filter(cset, 0, filter);
158 cset_add_filter_program(struct creation_set *cset, const char *filter)
160 _cset_add_filter(cset, 1, filter);
164 cset_read_support_filter_program(struct creation_set *cset, struct archive *a)
168 for (i = 0; i < cset->filter_count; i++) {
169 if (cset->filters[i].program) {
170 archive_read_support_filter_program(a,
171 cset->filters[i].filter_name);
179 cset_write_add_filters(struct creation_set *cset, struct archive *a,
180 const void **filter_name)
184 for (i = 0; i < cset->filter_count; i++) {
185 if (cset->filters[i].program)
186 r = archive_write_add_filter_program(a,
187 cset->filters[i].filter_name);
189 r = archive_write_add_filter_by_name(a,
190 cset->filters[i].filter_name);
191 if (r < ARCHIVE_WARN) {
192 *filter_name = cset->filters[i].filter_name;
201 cset_set_format(struct creation_set *cset, const char *format)
207 lafe_errc(1, 0, "No memory");
208 free(cset->create_format);
209 cset->create_format = f;
213 cset_get_format(struct creation_set *cset)
215 return (cset->create_format);
219 _cleanup_filters(struct filter_set *filters, int count)
223 for (i = 0; i < count; i++)
224 free(filters[i].filter_name);
229 * Clean up a creation set.
232 cset_free(struct creation_set *cset)
234 _cleanup_filters(cset->filters, cset->filter_count);
235 free(cset->create_format);
239 struct creation_set *
242 return calloc(1, sizeof(struct creation_set));
246 * Build a creation set by a file name suffix.
249 cset_auto_compress(struct creation_set *cset, const char *filename)
251 struct filter_set *old_filters;
254 int old_filter_count;
256 name = strdup(filename);
258 lafe_errc(1, 0, "No memory");
259 /* Save previous filters. */
260 old_filters = cset->filters;
261 old_filter_count = cset->filter_count;
262 cset->filters = NULL;
263 cset->filter_count = 0;
266 /* Get the suffix. */
267 p = strrchr(name, '.');
270 /* Suppose it indicates compression/filter type
272 code = get_filter_code(p);
274 cset_add_filter(cset, code);
278 /* Suppose it indicates format type such as ".tar". */
279 code = get_format_code(p);
281 cset_set_format(cset, code);
284 /* Suppose it indicates alias such as ".tgz". */
285 code = decompose_alias(p);
288 /* Replace the suffix. */
290 name = realloc(name, strlen(name) + strlen(code) + 1);
292 lafe_errc(1, 0, "No memory");
297 struct filter_set *v;
300 /* Release previous filters. */
301 _cleanup_filters(old_filters, old_filter_count);
303 v = malloc(sizeof(*v) * cset->filter_count);
305 lafe_errc(1, 0, "No memory");
306 /* Reverse filter sequence. */
307 for (i = 0, r = cset->filter_count; r > 0; )
308 v[i++] = cset->filters[--r];
313 /* Put previous filters back. */
314 cset->filters = old_filters;
315 cset->filter_count = old_filter_count;