fnmatch.c revision 1.17.4.1 1 /* $NetBSD: fnmatch.c,v 1.17.4.1 2000/07/03 22:30:13 thorpej Exp $ */
2
3 /*
4 * Copyright (c) 1989, 1993, 1994
5 * The Regents of the University of California. All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * Guido van Rossum.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
37 */
38
39 #include <sys/cdefs.h>
40 #if defined(LIBC_SCCS) && !defined(lint)
41 #if 0
42 static char sccsid[] = "@(#)fnmatch.c 8.2 (Berkeley) 4/16/94";
43 #else
44 __RCSID("$NetBSD: fnmatch.c,v 1.17.4.1 2000/07/03 22:30:13 thorpej Exp $");
45 #endif
46 #endif /* LIBC_SCCS and not lint */
47
48 /*
49 * Function fnmatch() as specified in POSIX 1003.2-1992, section B.6.
50 * Compares a filename or pathname to a pattern.
51 */
52
53 #include "namespace.h"
54
55 #include <assert.h>
56 #include <ctype.h>
57 #include <fnmatch.h>
58 #include <string.h>
59
60 #ifdef __weak_alias
61 __weak_alias(fnmatch,_fnmatch)
62 #endif
63
64 #define EOS '\0'
65
66 static const char *rangematch __P((const char *, int, int));
67
68 static __inline int
69 foldcase(int ch, int flags)
70 {
71
72 if ((flags & FNM_CASEFOLD) != 0 && isupper(ch))
73 return (tolower(ch));
74 return (ch);
75 }
76
77 #define FOLDCASE(ch, flags) foldcase((unsigned char)(ch), (flags))
78
79 int
80 fnmatch(pattern, string, flags)
81 const char *pattern, *string;
82 int flags;
83 {
84 const char *stringstart;
85 char c, test;
86
87 _DIAGASSERT(pattern != NULL);
88 _DIAGASSERT(string != NULL);
89
90 for (stringstart = string;;)
91 switch (c = FOLDCASE(*pattern++, flags)) {
92 case EOS:
93 return (*string == EOS ? 0 : FNM_NOMATCH);
94 case '?':
95 if (*string == EOS)
96 return (FNM_NOMATCH);
97 if (*string == '/' && (flags & FNM_PATHNAME))
98 return (FNM_NOMATCH);
99 if (*string == '.' && (flags & FNM_PERIOD) &&
100 (string == stringstart ||
101 ((flags & FNM_PATHNAME) && *(string - 1) == '/')))
102 return (FNM_NOMATCH);
103 ++string;
104 break;
105 case '*':
106 c = FOLDCASE(*pattern, flags);
107 /* Collapse multiple stars. */
108 while (c == '*')
109 c = FOLDCASE(*++pattern, flags);
110
111 if (*string == '.' && (flags & FNM_PERIOD) &&
112 (string == stringstart ||
113 ((flags & FNM_PATHNAME) && *(string - 1) == '/')))
114 return (FNM_NOMATCH);
115
116 /* Optimize for pattern with * at end or before /. */
117 if (c == EOS) {
118 if (flags & FNM_PATHNAME)
119 return (strchr(string, '/') == NULL ?
120 0 : FNM_NOMATCH);
121 else
122 return (0);
123 } else if (c == '/' && flags & FNM_PATHNAME) {
124 if ((string = strchr(string, '/')) == NULL)
125 return (FNM_NOMATCH);
126 break;
127 }
128
129 /* General case, use recursion. */
130 while ((test = FOLDCASE(*string, flags)) != EOS) {
131 if (!fnmatch(pattern, string,
132 flags & ~FNM_PERIOD))
133 return (0);
134 if (test == '/' && flags & FNM_PATHNAME)
135 break;
136 ++string;
137 }
138 return (FNM_NOMATCH);
139 case '[':
140 if (*string == EOS)
141 return (FNM_NOMATCH);
142 if (*string == '/' && flags & FNM_PATHNAME)
143 return (FNM_NOMATCH);
144 if ((pattern =
145 rangematch(pattern, FOLDCASE(*string, flags),
146 flags)) == NULL)
147 return (FNM_NOMATCH);
148 ++string;
149 break;
150 case '\\':
151 if (!(flags & FNM_NOESCAPE)) {
152 if ((c = FOLDCASE(*pattern++, flags)) == EOS) {
153 c = '\\';
154 --pattern;
155 }
156 }
157 /* FALLTHROUGH */
158 default:
159 if (c != FOLDCASE(*string++, flags))
160 return (FNM_NOMATCH);
161 break;
162 }
163 /* NOTREACHED */
164 }
165
166 static const char *
167 rangematch(pattern, test, flags)
168 const char *pattern;
169 int test, flags;
170 {
171 int negate, ok;
172 char c, c2;
173
174 _DIAGASSERT(pattern != NULL);
175
176 /*
177 * A bracket expression starting with an unquoted circumflex
178 * character produces unspecified results (IEEE 1003.2-1992,
179 * 3.13.2). This implementation treats it like '!', for
180 * consistency with the regular expression syntax.
181 * J.T. Conklin (conklin (at) ngai.kaleida.com)
182 */
183 if ((negate = (*pattern == '!' || *pattern == '^')) != 0)
184 ++pattern;
185
186 for (ok = 0; (c = FOLDCASE(*pattern++, flags)) != ']';) {
187 if (c == '\\' && !(flags & FNM_NOESCAPE))
188 c = FOLDCASE(*pattern++, flags);
189 if (c == EOS)
190 return (NULL);
191 if (*pattern == '-'
192 && (c2 = FOLDCASE(*(pattern+1), flags)) != EOS &&
193 c2 != ']') {
194 pattern += 2;
195 if (c2 == '\\' && !(flags & FNM_NOESCAPE))
196 c2 = FOLDCASE(*pattern++, flags);
197 if (c2 == EOS)
198 return (NULL);
199 if (c <= test && test <= c2)
200 ok = 1;
201 } else if (c == test)
202 ok = 1;
203 }
204 return (ok == negate ? NULL : pattern);
205 }
206