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