2 * Copyright (c) 2003-2007 Tim Kientzle
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$");
48 struct match *exclusions;
50 struct match *inclusions;
52 int inclusions_unmatched_count;
56 static void add_pattern(struct bsdtar *, struct match **list,
58 static int bsdtar_fnmatch(const char *p, const char *s);
59 static void initialize_matching(struct bsdtar *);
60 static int match_exclusion(struct match *, const char *pathname);
61 static int match_inclusion(struct match *, const char *pathname);
64 * The matching logic here needs to be re-thought. I started out to
65 * try to mimic gtar's matching logic, but it's not entirely
66 * consistent. In particular 'tar -t' and 'tar -x' interpret patterns
67 * on the command line as anchored, but --exclude doesn't.
71 * Utility functions to manage exclusion/inclusion patterns
75 exclude(struct bsdtar *bsdtar, const char *pattern)
77 struct matching *matching;
79 if (bsdtar->matching == NULL)
80 initialize_matching(bsdtar);
81 matching = bsdtar->matching;
82 add_pattern(bsdtar, &(matching->exclusions), pattern);
83 matching->exclusions_count++;
88 exclude_from_file(struct bsdtar *bsdtar, const char *pathname)
90 return (process_lines(bsdtar, pathname, &exclude));
94 include(struct bsdtar *bsdtar, const char *pattern)
96 struct matching *matching;
98 if (bsdtar->matching == NULL)
99 initialize_matching(bsdtar);
100 matching = bsdtar->matching;
101 add_pattern(bsdtar, &(matching->inclusions), pattern);
102 matching->inclusions_count++;
103 matching->inclusions_unmatched_count++;
108 include_from_file(struct bsdtar *bsdtar, const char *pathname)
110 return (process_lines(bsdtar, pathname, &include));
114 add_pattern(struct bsdtar *bsdtar, struct match **list, const char *pattern)
118 match = malloc(sizeof(*match) + strlen(pattern) + 1);
120 bsdtar_errc(bsdtar, 1, errno, "Out of memory");
121 if (pattern[0] == '/')
123 strcpy(match->pattern, pattern);
124 /* Both "foo/" and "foo" should match "foo/bar". */
125 if (match->pattern[strlen(match->pattern)-1] == '/')
126 match->pattern[strlen(match->pattern)-1] = '\0';
134 excluded(struct bsdtar *bsdtar, const char *pathname)
136 struct matching *matching;
138 struct match *matched;
140 matching = bsdtar->matching;
141 if (matching == NULL)
144 /* Exclusions take priority */
145 for (match = matching->exclusions; match != NULL; match = match->next){
146 if (match_exclusion(match, pathname))
150 /* Then check for inclusions */
152 for (match = matching->inclusions; match != NULL; match = match->next){
153 if (match_inclusion(match, pathname)) {
155 * If this pattern has never been matched,
158 if (match->matches == 0) {
160 matching->inclusions_unmatched_count++;
164 * Otherwise, remember the match but keep checking
165 * in case we can tick off an unmatched pattern.
171 * We didn't find a pattern that had never been matched, but
172 * we did find a match, so count it and exit.
174 if (matched != NULL) {
179 /* If there were inclusions, default is to exclude. */
180 if (matching->inclusions != NULL)
183 /* No explicit inclusions, default is to match. */
188 * This is a little odd, but it matches the default behavior of
189 * gtar. In particular, 'a*b' will match 'foo/a1111/222b/bar'
193 match_exclusion(struct match *match, const char *pathname)
197 if (*match->pattern == '*' || *match->pattern == '/')
198 return (bsdtar_fnmatch(match->pattern, pathname) == 0);
200 for (p = pathname; p != NULL; p = strchr(p, '/')) {
203 if (bsdtar_fnmatch(match->pattern, p) == 0)
210 * Again, mimic gtar: inclusions are always anchored (have to match
211 * the beginning of the path) even though exclusions are not anchored.
214 match_inclusion(struct match *match, const char *pathname)
216 return (bsdtar_fnmatch(match->pattern, pathname) == 0);
220 cleanup_exclusions(struct bsdtar *bsdtar)
224 if (bsdtar->matching) {
225 p = bsdtar->matching->inclusions;
231 p = bsdtar->matching->exclusions;
237 free(bsdtar->matching);
242 initialize_matching(struct bsdtar *bsdtar)
244 bsdtar->matching = malloc(sizeof(*bsdtar->matching));
245 if (bsdtar->matching == NULL)
246 bsdtar_errc(bsdtar, 1, errno, "No memory");
247 memset(bsdtar->matching, 0, sizeof(*bsdtar->matching));
251 unmatched_inclusions(struct bsdtar *bsdtar)
253 struct matching *matching;
255 matching = bsdtar->matching;
256 if (matching == NULL)
258 return (matching->inclusions_unmatched_count);
263 #if defined(HAVE_FNMATCH) && defined(HAVE_FNM_LEADING_DIR)
265 /* Use system fnmatch() if it suits our needs. */
266 /* On Linux, _GNU_SOURCE must be defined to get FNM_LEADING_DIR. */
270 bsdtar_fnmatch(const char *pattern, const char *string)
272 return (fnmatch(pattern, string, FNM_LEADING_DIR));
277 * The following was hacked from BSD C library
278 * code: src/lib/libc/gen/fnmatch.c,v 1.15 2002/02/01
280 * In particular, most of the flags were ripped out: this always
281 * behaves like FNM_LEADING_DIR is set and other flags specified
282 * by POSIX are unset.
284 * Normally, I would not conditionally compile something like this: If
285 * I have to support it anyway, everyone may as well use it. ;-)
286 * However, the full POSIX spec for fnmatch() includes a lot of
287 * advanced character handling that I'm not ready to put in here, so
288 * it's probably best if people use a local version when it's available.
292 * Copyright (c) 1989, 1993, 1994
293 * The Regents of the University of California. All rights reserved.
295 * This code is derived from software contributed to Berkeley by
298 * Redistribution and use in source and binary forms, with or without
299 * modification, are permitted provided that the following conditions
301 * 1. Redistributions of source code must retain the above copyright
302 * notice, this list of conditions and the following disclaimer.
303 * 2. Redistributions in binary form must reproduce the above copyright
304 * notice, this list of conditions and the following disclaimer in the
305 * documentation and/or other materials provided with the distribution.
306 * 4. Neither the name of the University nor the names of its contributors
307 * may be used to endorse or promote products derived from this software
308 * without specific prior written permission.
310 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
311 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
312 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
313 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
314 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
315 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
316 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
317 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
318 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
319 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
324 bsdtar_fnmatch(const char *pattern, const char *string)
326 const char *saved_pattern;
331 switch (c = *pattern++) {
333 if (*string == '/' || *string == '\0')
343 /* Collapse multiple stars. */
347 /* Optimize for pattern with * at end. */
351 /* General case, use recursion. */
352 while (*string != '\0') {
353 if (!bsdtar_fnmatch(pattern, string))
361 saved_pattern = pattern;
362 if (*pattern == '!' || *pattern == '^') {
373 pattern = saved_pattern;
377 if (*pattern == '-') {
378 char c2 = *(pattern + 1);
380 pattern = saved_pattern;
385 /* [a-] is not a range. */
396 } else if (c == *string)
400 if (matched == negate)
405 if ((c = *pattern++) == '\0') {