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