2 * Copyright (c) 1989, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 /* OpenBSD: fnmatch.c,v 1.6 1998/03/19 00:29:59 millert */
36 * Function fnmatch() as specified in POSIX 1003.2-1992, section B.6.
37 * Compares a filename or pathname to a pattern.
42 /* Define SYS to use the system fnmatch() rather than ours */
56 #define RANGE_NOMATCH 0
57 #define RANGE_ERROR (-1)
59 #define ISSET(x, y) ((x) & (y))
60 #define FOLD(c) ((flags & FNM_CASEFOLD) && B_ISUPPER(c) ? tolower(c) : (c))
62 static int rangematch(const char *, char, int, char **);
65 int xfnmatch(const char *pattern, const char *string, int flags)
67 int fnmatch(const char *pattern, const char *string, int flags)
70 const char *stringstart;
76 switch (c = *pattern++) {
78 if (ISSET(flags, FNM_LEADING_DIR) && IsPathSeparator(*string))
80 return (*string == EOS ? 0 : FNM_NOMATCH);
84 if (IsPathSeparator(*string) && ISSET(flags, FNM_PATHNAME))
86 if (*string == '.' && ISSET(flags, FNM_PERIOD) &&
87 (string == stringstart ||
88 (ISSET(flags, FNM_PATHNAME) && IsPathSeparator(*(string - 1)))))
94 /* Collapse multiple stars. */
99 if (*string == '.' && ISSET(flags, FNM_PERIOD) &&
100 (string == stringstart ||
101 (ISSET(flags, FNM_PATHNAME) && IsPathSeparator(*(string - 1))))) {
102 return (FNM_NOMATCH);
105 /* Optimize for pattern with * at end or before /. */
107 if (ISSET(flags, FNM_PATHNAME)) {
108 return (ISSET(flags, FNM_LEADING_DIR) ||
109 strchr(string, '/') == NULL ? 0 : FNM_NOMATCH);
113 } else if (IsPathSeparator(c) && ISSET(flags, FNM_PATHNAME)) {
114 if ((string = strchr(string, '/')) == NULL)
115 return (FNM_NOMATCH);
119 /* General case, use recursion. */
120 while ((test = *string) != EOS) {
121 if (!fnmatch(pattern, string, flags & ~FNM_PERIOD)) {
124 if (test == '/' && ISSET(flags, FNM_PATHNAME)) {
129 return (FNM_NOMATCH);
132 return (FNM_NOMATCH);
133 if (IsPathSeparator(*string) && ISSET(flags, FNM_PATHNAME))
134 return (FNM_NOMATCH);
135 if (*string == '.' && ISSET(flags, FNM_PERIOD) &&
136 (string == stringstart ||
137 (ISSET(flags, FNM_PATHNAME) && IsPathSeparator(*(string - 1)))))
138 return (FNM_NOMATCH);
140 switch (rangematch(pattern, *string, flags, &newp)) {
142 /* not a good range, treat as normal text */
148 return (FNM_NOMATCH);
154 if (!ISSET(flags, FNM_NOESCAPE)) {
155 if ((c = *pattern++) == EOS) {
163 if (FOLD(c) != FOLD(*string)) {
164 return (FNM_NOMATCH);
173 static int rangematch(const char *pattern, char test, int flags,
180 * A bracket expression starting with an unquoted circumflex
181 * character produces unspecified results (IEEE 1003.2-1992,
182 * 3.13.2). This implementation treats it like '!', for
183 * consistency with the regular expression syntax.
184 * J.T. Conklin (conklin@ngai.kaleida.com)
186 if ((negate = (*pattern == '!' || *pattern == '^')))
192 * A right bracket shall lose its special meaning and represent
193 * itself in a bracket expression if it occurs first in the list.
199 if (c == '\\' && !ISSET(flags, FNM_NOESCAPE))
202 return (RANGE_ERROR);
203 if (c == '/' && ISSET(flags, FNM_PATHNAME))
204 return (RANGE_NOMATCH);
206 if (*pattern == '-' && (c2 = *(pattern + 1)) != EOS && c2 != ']') {
208 if (c2 == '\\' && !ISSET(flags, FNM_NOESCAPE))
211 return (RANGE_ERROR);
213 if (c <= test && test <= c2)
215 } else if (c == test)
217 } while ((c = *pattern++) != ']');
219 *newp = (char *) pattern;
220 return (ok == negate ? RANGE_NOMATCH : RANGE_MATCH);
232 * Note, some of these tests were duplicated from a patch file I found
233 * in an email, so I am unsure what the license is. Since this code is
234 * never turned on in any release, it probably doesn't matter at all.
235 * If by some chance someone finds this to be a problem please let
238 static struct test tests[] = {
239 /*1*/ {"x", "x", FNM_PATHNAME | FNM_LEADING_DIR, 0},
240 {"x", "x/y", FNM_PATHNAME | FNM_LEADING_DIR, 0},
241 {"x", "x/y/z", FNM_PATHNAME | FNM_LEADING_DIR, 0},
242 {"*", "x", FNM_PATHNAME | FNM_LEADING_DIR, 0},
243 /*5*/ {"*", "x/y", FNM_PATHNAME | FNM_LEADING_DIR, 0},
244 {"*", "x/y/z", FNM_PATHNAME | FNM_LEADING_DIR, 0},
245 {"*x", "x", FNM_PATHNAME | FNM_LEADING_DIR, 0},
246 {"*x", "x/y", FNM_PATHNAME | FNM_LEADING_DIR, 0},
247 {"*x", "x/y/z", FNM_PATHNAME | FNM_LEADING_DIR, 0},
248 /*10*/ {"x*", "x", FNM_PATHNAME | FNM_LEADING_DIR, 0},
249 {"x*", "x/y", FNM_PATHNAME | FNM_LEADING_DIR, 0},
250 {"x*", "x/y/z", FNM_PATHNAME | FNM_LEADING_DIR, 0},
251 {"a*b/*", "abbb/.x", FNM_PATHNAME|FNM_PERIOD, FNM_NOMATCH},
252 {"a*b/*", "abbb/xy", FNM_PATHNAME|FNM_PERIOD, 0},
253 /*15*/ {"[A-[]", "A", 0, 0},
254 {"[A-[]", "a", 0, FNM_NOMATCH},
255 {"[a-{]", "A", 0, FNM_NOMATCH},
256 {"[a-{]", "a", 0, 0},
257 {"[A-[]", "A", FNM_CASEFOLD, FNM_NOMATCH},
258 /*20*/ {"[A-[]", "a", FNM_CASEFOLD, FNM_NOMATCH},
259 {"[a-{]", "A", FNM_CASEFOLD, 0},
260 {"[a-{]", "a", FNM_CASEFOLD, 0},
261 { "*LIB*", "lib", FNM_PERIOD, FNM_NOMATCH },
262 { "*LIB*", "lib", FNM_CASEFOLD, 0},
263 /*25*/ { "a[/]b", "a/b", 0, 0},
264 { "a[/]b", "a/b", FNM_PATHNAME, FNM_NOMATCH },
265 { "[a-z]/[a-z]", "a/b", 0, 0 },
266 { "a/b", "*", FNM_PATHNAME, FNM_NOMATCH },
267 { "*", "a/b", FNM_PATHNAME, FNM_NOMATCH },
268 { "*[/]b", "a/b", FNM_PATHNAME, FNM_NOMATCH },
269 /*30*/ { "\\[/b", "[/b", 0, 0 },
270 { "?\?/b", "aa/b", 0, 0 },
271 { "???b", "aa/b", 0, 0 },
272 { "???b", "aa/b", FNM_PATHNAME, FNM_NOMATCH },
273 { "?a/b", ".a/b", FNM_PATHNAME|FNM_PERIOD, FNM_NOMATCH },
274 /*35*/ { "a/?b", "a/.b", FNM_PATHNAME|FNM_PERIOD, FNM_NOMATCH },
275 { "*a/b", ".a/b", FNM_PATHNAME|FNM_PERIOD, FNM_NOMATCH },
276 { "a/*b", "a/.b", FNM_PATHNAME|FNM_PERIOD, FNM_NOMATCH },
277 { "[.]a/b", ".a/b", FNM_PATHNAME|FNM_PERIOD, FNM_NOMATCH },
278 { "a/[.]b", "a/.b", FNM_PATHNAME|FNM_PERIOD, FNM_NOMATCH },
279 /*40*/ { "*/?", "a/b", FNM_PATHNAME|FNM_PERIOD, 0 },
280 { "?/*", "a/b", FNM_PATHNAME|FNM_PERIOD, 0 },
281 { ".*/?", ".a/b", FNM_PATHNAME|FNM_PERIOD, 0 },
282 { "*/.?", "a/.b", FNM_PATHNAME|FNM_PERIOD, 0 },
283 { "*/*", "a/.b", FNM_PATHNAME|FNM_PERIOD, FNM_NOMATCH },
284 /*45*/ { "*[.]/b", "a./b", FNM_PATHNAME|FNM_PERIOD, 0 },
285 { "a?b", "a.b", FNM_PATHNAME|FNM_PERIOD, 0 },
286 { "a*b", "a.b", FNM_PATHNAME|FNM_PERIOD, 0 },
287 { "a[.]b", "a.b", FNM_PATHNAME|FNM_PERIOD, 0 },
288 /*49*/ { "*a*", "a/b", FNM_PATHNAME|FNM_LEADING_DIR, 0 },
289 { "[/b", "[/b", 0, 0},
291 /* This test takes a *long* time */
292 {"a*b*c*d*e*f*g*h*i*j*k*l*m*n*o*p*q*r*s*t*u*v*w*x*y*z*",
293 "aaaabbbbccccddddeeeeffffgggghhhhiiiijjjjkkkkllllmmmm"
294 "nnnnooooppppqqqqrrrrssssttttuuuuvvvvwwwwxxxxyyyy", 0, FNM_NOMATCH},
297 /* Keep dummy last to avoid compiler warnings */
298 {"dummy", "dummy", 0, 0}
302 #define ntests ((int)(sizeof(tests)/sizeof(struct test)))
307 for (int i=0; i<ntests; i++) {
308 if (fnmatch(tests[i].pattern, tests[i].string, tests[i].options) != tests[i].result) {
309 printf("Test %d failed: pat=%s str=%s expect=%s got=%s\n",
310 i+1, tests[i].pattern, tests[i].string,
311 tests[i].result==0?"matches":"no match",
312 tests[i].result==0?"no match":"matches");
315 printf("Test %d succeeded\n", i+1);
320 #endif /* TEST_PROGRAM */