xref: /netbsd-src/lib/libc/gen/fnmatch.c (revision 4472dbe5e3bd91ef2540bada7a7ca7384627ff9b)
1 /*	$NetBSD: fnmatch.c,v 1.17 2000/01/22 22:19:10 mycroft 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 2000/01/22 22:19:10 mycroft 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 <fnmatch.h>
57 #include <string.h>
58 
59 #ifdef __weak_alias
60 __weak_alias(fnmatch,_fnmatch)
61 #endif
62 
63 #define	EOS	'\0'
64 
65 static const char *rangematch __P((const char *, int, int));
66 
67 int
68 fnmatch(pattern, string, flags)
69 	const char *pattern, *string;
70 	int flags;
71 {
72 	const char *stringstart;
73 	char c, test;
74 
75 	_DIAGASSERT(pattern != NULL);
76 	_DIAGASSERT(string != NULL);
77 
78 	for (stringstart = string;;)
79 		switch (c = *pattern++) {
80 		case EOS:
81 			return (*string == EOS ? 0 : FNM_NOMATCH);
82 		case '?':
83 			if (*string == EOS)
84 				return (FNM_NOMATCH);
85 			if (*string == '/' && (flags & FNM_PATHNAME))
86 				return (FNM_NOMATCH);
87 			if (*string == '.' && (flags & FNM_PERIOD) &&
88 			    (string == stringstart ||
89 			    ((flags & FNM_PATHNAME) && *(string - 1) == '/')))
90 				return (FNM_NOMATCH);
91 			++string;
92 			break;
93 		case '*':
94 			c = *pattern;
95 			/* Collapse multiple stars. */
96 			while (c == '*')
97 				c = *++pattern;
98 
99 			if (*string == '.' && (flags & FNM_PERIOD) &&
100 			    (string == stringstart ||
101 			    ((flags & FNM_PATHNAME) && *(string - 1) == '/')))
102 				return (FNM_NOMATCH);
103 
104 			/* Optimize for pattern with * at end or before /. */
105 			if (c == EOS) {
106 				if (flags & FNM_PATHNAME)
107 					return (strchr(string, '/') == NULL ?
108 					    0 : FNM_NOMATCH);
109 				else
110 					return (0);
111 			} else if (c == '/' && flags & FNM_PATHNAME) {
112 				if ((string = strchr(string, '/')) == NULL)
113 					return (FNM_NOMATCH);
114 				break;
115 			}
116 
117 			/* General case, use recursion. */
118 			while ((test = *string) != EOS) {
119 				if (!fnmatch(pattern, string, flags & ~FNM_PERIOD))
120 					return (0);
121 				if (test == '/' && flags & FNM_PATHNAME)
122 					break;
123 				++string;
124 			}
125 			return (FNM_NOMATCH);
126 		case '[':
127 			if (*string == EOS)
128 				return (FNM_NOMATCH);
129 			if (*string == '/' && flags & FNM_PATHNAME)
130 				return (FNM_NOMATCH);
131 			if ((pattern =
132 			    rangematch(pattern, *string, flags)) == NULL)
133 				return (FNM_NOMATCH);
134 			++string;
135 			break;
136 		case '\\':
137 			if (!(flags & FNM_NOESCAPE)) {
138 				if ((c = *pattern++) == EOS) {
139 					c = '\\';
140 					--pattern;
141 				}
142 			}
143 			/* FALLTHROUGH */
144 		default:
145 			if (c != *string++)
146 				return (FNM_NOMATCH);
147 			break;
148 		}
149 	/* NOTREACHED */
150 }
151 
152 static const char *
153 rangematch(pattern, test, flags)
154 	const char *pattern;
155 	int test, flags;
156 {
157 	int negate, ok;
158 	char c, c2;
159 
160 	_DIAGASSERT(pattern != NULL);
161 
162 	/*
163 	 * A bracket expression starting with an unquoted circumflex
164 	 * character produces unspecified results (IEEE 1003.2-1992,
165 	 * 3.13.2).  This implementation treats it like '!', for
166 	 * consistency with the regular expression syntax.
167 	 * J.T. Conklin (conklin@ngai.kaleida.com)
168 	 */
169 	if ((negate = (*pattern == '!' || *pattern == '^')) != 0)
170 		++pattern;
171 
172 	for (ok = 0; (c = *pattern++) != ']';) {
173 		if (c == '\\' && !(flags & FNM_NOESCAPE))
174 			c = *pattern++;
175 		if (c == EOS)
176 			return (NULL);
177 		if (*pattern == '-'
178 		    && (c2 = *(pattern+1)) != EOS && c2 != ']') {
179 			pattern += 2;
180 			if (c2 == '\\' && !(flags & FNM_NOESCAPE))
181 				c2 = *pattern++;
182 			if (c2 == EOS)
183 				return (NULL);
184 			if (c <= test && test <= c2)
185 				ok = 1;
186 		} else if (c == test)
187 			ok = 1;
188 	}
189 	return (ok == negate ? NULL : pattern);
190 }
191