1 /* 2 * Copyright (c) 1989, 1993, 1994 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * Guido van Rossum. 7 * 8 * Copyright (c) 2011 The FreeBSD Foundation 9 * All rights reserved. 10 * Portions of this software were developed by David Chisnall 11 * under sponsorship from the FreeBSD Foundation. 12 * 13 * Redistribution and use in source and binary forms, with or without 14 * modification, are permitted provided that the following conditions 15 * are met: 16 * 1. Redistributions of source code must retain the above copyright 17 * notice, this list of conditions and the following disclaimer. 18 * 2. Redistributions in binary form must reproduce the above copyright 19 * notice, this list of conditions and the following disclaimer in the 20 * documentation and/or other materials provided with the distribution. 21 * 4. Neither the name of the University nor the names of its contributors 22 * may be used to endorse or promote products derived from this software 23 * without specific prior written permission. 24 * 25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35 * SUCH DAMAGE. 36 */ 37 38 #if defined(LIBC_SCCS) && !defined(lint) 39 static char sccsid[] = "@(#)fnmatch.c 8.2 (Berkeley) 4/16/94"; 40 #endif /* LIBC_SCCS and not lint */ 41 #include <sys/cdefs.h> 42 __FBSDID("$FreeBSD$"); 43 44 /* 45 * Function fnmatch() as specified in POSIX 1003.2-1992, section B.6. 46 * Compares a filename or pathname to a pattern. 47 */ 48 49 /* 50 * Some notes on multibyte character support: 51 * 1. Patterns with illegal byte sequences match nothing. 52 * 2. Illegal byte sequences in the "string" argument are handled by treating 53 * them as single-byte characters with a value of the first byte of the 54 * sequence cast to wchar_t. 55 * 3. Multibyte conversion state objects (mbstate_t) are passed around and 56 * used for most, but not all, conversions. Further work will be required 57 * to support state-dependent encodings. 58 */ 59 60 #include <fnmatch.h> 61 #include <limits.h> 62 #include <string.h> 63 #include <wchar.h> 64 #include <wctype.h> 65 66 #define EOS '\0' 67 68 #define RANGE_MATCH 1 69 #define RANGE_NOMATCH 0 70 #define RANGE_ERROR (-1) 71 72 static int rangematch(const char *, wchar_t, int, char **, mbstate_t *); 73 static int fnmatch1(const char *, const char *, const char *, int, mbstate_t, 74 mbstate_t); 75 76 int 77 fnmatch(const char *pattern, const char *string, int flags) 78 { 79 static const mbstate_t initial; 80 81 return (fnmatch1(pattern, string, string, flags, initial, initial)); 82 } 83 84 static int 85 fnmatch1(const char *pattern, const char *string, const char *stringstart, 86 int flags, mbstate_t patmbs, mbstate_t strmbs) 87 { 88 const char *bt_pattern, *bt_string; 89 mbstate_t bt_patmbs, bt_strmbs; 90 char *newp; 91 char c; 92 wchar_t pc, sc; 93 size_t pclen, sclen; 94 95 bt_pattern = bt_string = NULL; 96 for (;;) { 97 pclen = mbrtowc(&pc, pattern, MB_LEN_MAX, &patmbs); 98 if (pclen == (size_t)-1 || pclen == (size_t)-2) 99 return (FNM_NOMATCH); 100 pattern += pclen; 101 sclen = mbrtowc(&sc, string, MB_LEN_MAX, &strmbs); 102 if (sclen == (size_t)-1 || sclen == (size_t)-2) { 103 sc = (unsigned char)*string; 104 sclen = 1; 105 memset(&strmbs, 0, sizeof(strmbs)); 106 } 107 switch (pc) { 108 case EOS: 109 if ((flags & FNM_LEADING_DIR) && sc == '/') 110 return (0); 111 if (sc == EOS) 112 return (0); 113 goto backtrack; 114 case '?': 115 if (sc == EOS) 116 return (FNM_NOMATCH); 117 if (sc == '/' && (flags & FNM_PATHNAME)) 118 goto backtrack; 119 if (sc == '.' && (flags & FNM_PERIOD) && 120 (string == stringstart || 121 ((flags & FNM_PATHNAME) && *(string - 1) == '/'))) 122 goto backtrack; 123 string += sclen; 124 break; 125 case '*': 126 c = *pattern; 127 /* Collapse multiple stars. */ 128 while (c == '*') 129 c = *++pattern; 130 131 if (sc == '.' && (flags & FNM_PERIOD) && 132 (string == stringstart || 133 ((flags & FNM_PATHNAME) && *(string - 1) == '/'))) 134 goto backtrack; 135 136 /* Optimize for pattern with * at end or before /. */ 137 if (c == EOS) 138 if (flags & FNM_PATHNAME) 139 return ((flags & FNM_LEADING_DIR) || 140 strchr(string, '/') == NULL ? 141 0 : FNM_NOMATCH); 142 else 143 return (0); 144 else if (c == '/' && flags & FNM_PATHNAME) { 145 if ((string = strchr(string, '/')) == NULL) 146 return (FNM_NOMATCH); 147 break; 148 } 149 150 /* 151 * First try the shortest match for the '*' that 152 * could work. We can forget any earlier '*' since 153 * there is no way having it match more characters 154 * can help us, given that we are already here. 155 */ 156 bt_pattern = pattern, bt_patmbs = patmbs; 157 bt_string = string, bt_strmbs = strmbs; 158 break; 159 case '[': 160 if (sc == EOS) 161 return (FNM_NOMATCH); 162 if (sc == '/' && (flags & FNM_PATHNAME)) 163 goto backtrack; 164 if (sc == '.' && (flags & FNM_PERIOD) && 165 (string == stringstart || 166 ((flags & FNM_PATHNAME) && *(string - 1) == '/'))) 167 goto backtrack; 168 169 switch (rangematch(pattern, sc, flags, &newp, 170 &patmbs)) { 171 case RANGE_ERROR: 172 goto norm; 173 case RANGE_MATCH: 174 pattern = newp; 175 break; 176 case RANGE_NOMATCH: 177 goto backtrack; 178 } 179 string += sclen; 180 break; 181 case '\\': 182 if (!(flags & FNM_NOESCAPE)) { 183 pclen = mbrtowc(&pc, pattern, MB_LEN_MAX, 184 &patmbs); 185 if (pclen == (size_t)-1 || pclen == (size_t)-2) 186 return (FNM_NOMATCH); 187 pattern += pclen; 188 } 189 /* FALLTHROUGH */ 190 default: 191 norm: 192 string += sclen; 193 if (pc == sc) 194 ; 195 else if ((flags & FNM_CASEFOLD) && 196 (towlower(pc) == towlower(sc))) 197 ; 198 else { 199 backtrack: 200 /* 201 * If we have a mismatch (other than hitting 202 * the end of the string), go back to the last 203 * '*' seen and have it match one additional 204 * character. 205 */ 206 if (bt_pattern == NULL) 207 return (FNM_NOMATCH); 208 sclen = mbrtowc(&sc, bt_string, MB_LEN_MAX, 209 &bt_strmbs); 210 if (sclen == (size_t)-1 || 211 sclen == (size_t)-2) { 212 sc = (unsigned char)*bt_string; 213 sclen = 1; 214 memset(&bt_strmbs, 0, 215 sizeof(bt_strmbs)); 216 } 217 if (sc == EOS) 218 return (FNM_NOMATCH); 219 if (sc == '/' && flags & FNM_PATHNAME) 220 return (FNM_NOMATCH); 221 bt_string += sclen; 222 pattern = bt_pattern, patmbs = bt_patmbs; 223 string = bt_string, strmbs = bt_strmbs; 224 } 225 break; 226 } 227 } 228 /* NOTREACHED */ 229 } 230 231 static int 232 rangematch(const char *pattern, wchar_t test, int flags, char **newp, 233 mbstate_t *patmbs) 234 { 235 int negate, ok; 236 wchar_t c, c2; 237 size_t pclen; 238 const char *origpat; 239 240 /* 241 * A bracket expression starting with an unquoted circumflex 242 * character produces unspecified results (IEEE 1003.2-1992, 243 * 3.13.2). This implementation treats it like '!', for 244 * consistency with the regular expression syntax. 245 * J.T. Conklin (conklin@ngai.kaleida.com) 246 */ 247 if ( (negate = (*pattern == '!' || *pattern == '^')) ) 248 ++pattern; 249 250 if (flags & FNM_CASEFOLD) 251 test = towlower(test); 252 253 /* 254 * A right bracket shall lose its special meaning and represent 255 * itself in a bracket expression if it occurs first in the list. 256 * -- POSIX.2 2.8.3.2 257 */ 258 ok = 0; 259 origpat = pattern; 260 for (;;) { 261 if (*pattern == ']' && pattern > origpat) { 262 pattern++; 263 break; 264 } else if (*pattern == '\0') { 265 return (RANGE_ERROR); 266 } else if (*pattern == '/' && (flags & FNM_PATHNAME)) { 267 return (RANGE_NOMATCH); 268 } else if (*pattern == '\\' && !(flags & FNM_NOESCAPE)) 269 pattern++; 270 pclen = mbrtowc(&c, pattern, MB_LEN_MAX, patmbs); 271 if (pclen == (size_t)-1 || pclen == (size_t)-2) 272 return (RANGE_NOMATCH); 273 pattern += pclen; 274 275 if (flags & FNM_CASEFOLD) 276 c = towlower(c); 277 278 if (*pattern == '-' && *(pattern + 1) != EOS && 279 *(pattern + 1) != ']') { 280 if (*++pattern == '\\' && !(flags & FNM_NOESCAPE)) 281 if (*pattern != EOS) 282 pattern++; 283 pclen = mbrtowc(&c2, pattern, MB_LEN_MAX, patmbs); 284 if (pclen == (size_t)-1 || pclen == (size_t)-2) 285 return (RANGE_NOMATCH); 286 pattern += pclen; 287 if (c2 == EOS) 288 return (RANGE_ERROR); 289 290 if (flags & FNM_CASEFOLD) 291 c2 = towlower(c2); 292 293 if (c <= test && test <= c2) 294 ok = 1; 295 } else if (c == test) 296 ok = 1; 297 } 298 299 *newp = (char *)pattern; 300 return (ok == negate ? RANGE_NOMATCH : RANGE_MATCH); 301 } 302