version 1.1.1.2, 1995/02/25 09:11:31 |
version 1.21.40.1, 2011/02/08 16:18:59 |
|
|
|
/* $NetBSD$ */ |
|
|
/* |
/* |
* Copyright (c) 1989, 1993, 1994 |
* Copyright (c) 1989, 1993, 1994 |
* The Regents of the University of California. All rights reserved. |
* The Regents of the University of California. All rights reserved. |
|
|
* 2. Redistributions in binary form must reproduce the above copyright |
* 2. Redistributions in binary form must reproduce the above copyright |
* notice, this list of conditions and the following disclaimer in the |
* notice, this list of conditions and the following disclaimer in the |
* documentation and/or other materials provided with the distribution. |
* documentation and/or other materials provided with the distribution. |
* 3. All advertising materials mentioning features or use of this software |
* 3. Neither the name of the University nor the names of its contributors |
* must display the following acknowledgement: |
|
* This product includes software developed by the University of |
|
* California, Berkeley and its contributors. |
|
* 4. Neither the name of the University nor the names of its contributors |
|
* may be used to endorse or promote products derived from this software |
* may be used to endorse or promote products derived from this software |
* without specific prior written permission. |
* without specific prior written permission. |
* |
* |
|
|
* SUCH DAMAGE. |
* SUCH DAMAGE. |
*/ |
*/ |
|
|
|
#include <sys/cdefs.h> |
#if defined(LIBC_SCCS) && !defined(lint) |
#if defined(LIBC_SCCS) && !defined(lint) |
|
#if 0 |
static char sccsid[] = "@(#)fnmatch.c 8.2 (Berkeley) 4/16/94"; |
static char sccsid[] = "@(#)fnmatch.c 8.2 (Berkeley) 4/16/94"; |
|
#else |
|
__RCSID("$NetBSD$"); |
|
#endif |
#endif /* LIBC_SCCS and not lint */ |
#endif /* LIBC_SCCS and not lint */ |
|
|
/* |
/* |
Line 43 static char sccsid[] = "@(#)fnmatch.c 8. |
|
Line 46 static char sccsid[] = "@(#)fnmatch.c 8. |
|
* Compares a filename or pathname to a pattern. |
* Compares a filename or pathname to a pattern. |
*/ |
*/ |
|
|
|
#include "namespace.h" |
|
|
|
#include <assert.h> |
|
#include <ctype.h> |
#include <fnmatch.h> |
#include <fnmatch.h> |
#include <string.h> |
#include <string.h> |
|
|
|
#ifdef __weak_alias |
|
__weak_alias(fnmatch,_fnmatch) |
|
#endif |
|
|
#define EOS '\0' |
#define EOS '\0' |
|
|
static const char *rangematch __P((const char *, int, int)); |
static inline int |
|
foldcase(int ch, int flags) |
|
{ |
|
|
int |
if ((flags & FNM_CASEFOLD) != 0 && isupper(ch)) |
fnmatch(pattern, string, flags) |
return tolower(ch); |
const char *pattern, *string; |
return ch; |
int flags; |
} |
|
|
|
#define FOLDCASE(ch, flags) foldcase((unsigned char)(ch), (flags)) |
|
|
|
static const char * |
|
rangematch(const char *pattern, int test, int flags) |
|
{ |
|
int negate, ok; |
|
char c, c2; |
|
|
|
_DIAGASSERT(pattern != NULL); |
|
|
|
/* |
|
* A bracket expression starting with an unquoted circumflex |
|
* character produces unspecified results (IEEE 1003.2-1992, |
|
* 3.13.2). This implementation treats it like '!', for |
|
* consistency with the regular expression syntax. |
|
* J.T. Conklin (conklin@ngai.kaleida.com) |
|
*/ |
|
if ((negate = (*pattern == '!' || *pattern == '^')) != 0) |
|
++pattern; |
|
|
|
for (ok = 0; (c = FOLDCASE(*pattern++, flags)) != ']';) { |
|
if (c == '\\' && !(flags & FNM_NOESCAPE)) |
|
c = FOLDCASE(*pattern++, flags); |
|
if (c == EOS) |
|
return NULL; |
|
if (*pattern == '-' |
|
&& (c2 = FOLDCASE(*(pattern + 1), flags)) != EOS && |
|
c2 != ']') { |
|
pattern += 2; |
|
if (c2 == '\\' && !(flags & FNM_NOESCAPE)) |
|
c2 = FOLDCASE(*pattern++, flags); |
|
if (c2 == EOS) |
|
return NULL; |
|
if (c <= test && test <= c2) |
|
ok = 1; |
|
} else if (c == test) |
|
ok = 1; |
|
} |
|
return ok == negate ? NULL : pattern; |
|
} |
|
|
|
|
|
static int |
|
fnmatchx(const char *pattern, const char *string, int flags, size_t recursion) |
{ |
{ |
const char *stringstart; |
const char *stringstart; |
char c, test; |
char c, test; |
|
|
for (stringstart = string;;) |
_DIAGASSERT(pattern != NULL); |
switch (c = *pattern++) { |
_DIAGASSERT(string != NULL); |
|
|
|
if (recursion-- == 0) |
|
return FNM_NORES; |
|
|
|
for (stringstart = string;;) { |
|
switch (c = FOLDCASE(*pattern++, flags)) { |
case EOS: |
case EOS: |
return (*string == EOS ? 0 : FNM_NOMATCH); |
if ((flags & FNM_LEADING_DIR) && *string == '/') |
|
return 0; |
|
return *string == EOS ? 0 : FNM_NOMATCH; |
case '?': |
case '?': |
if (*string == EOS) |
if (*string == EOS) |
return (FNM_NOMATCH); |
return FNM_NOMATCH; |
if (*string == '/' && (flags & FNM_PATHNAME)) |
if (*string == '/' && (flags & FNM_PATHNAME)) |
return (FNM_NOMATCH); |
return FNM_NOMATCH; |
if (*string == '.' && (flags & FNM_PERIOD) && |
if (*string == '.' && (flags & FNM_PERIOD) && |
(string == stringstart || |
(string == stringstart || |
((flags & FNM_PATHNAME) && *(string - 1) == '/'))) |
((flags & FNM_PATHNAME) && *(string - 1) == '/'))) |
return (FNM_NOMATCH); |
return FNM_NOMATCH; |
++string; |
++string; |
break; |
break; |
case '*': |
case '*': |
c = *pattern; |
c = FOLDCASE(*pattern, flags); |
/* Collapse multiple stars. */ |
/* Collapse multiple stars. */ |
while (c == '*') |
while (c == '*') |
c = *++pattern; |
c = FOLDCASE(*++pattern, flags); |
|
|
if (*string == '.' && (flags & FNM_PERIOD) && |
if (*string == '.' && (flags & FNM_PERIOD) && |
(string == stringstart || |
(string == stringstart || |
((flags & FNM_PATHNAME) && *(string - 1) == '/'))) |
((flags & FNM_PATHNAME) && *(string - 1) == '/'))) |
return (FNM_NOMATCH); |
return FNM_NOMATCH; |
|
|
/* Optimize for pattern with * at end or before /. */ |
/* Optimize for pattern with * at end or before /. */ |
if (c == EOS) |
if (c == EOS) { |
if (flags & FNM_PATHNAME) |
if (flags & FNM_PATHNAME) |
return (strchr(string, '/') == NULL ? |
return (flags & FNM_LEADING_DIR) || |
0 : FNM_NOMATCH); |
strchr(string, '/') == NULL ? |
|
0 : FNM_NOMATCH; |
else |
else |
return (0); |
return 0; |
else if (c == '/' && flags & FNM_PATHNAME) { |
} else if (c == '/' && flags & FNM_PATHNAME) { |
if ((string = strchr(string, '/')) == NULL) |
if ((string = strchr(string, '/')) == NULL) |
return (FNM_NOMATCH); |
return FNM_NOMATCH; |
break; |
break; |
} |
} |
|
|
/* General case, use recursion. */ |
/* General case, use recursion. */ |
while ((test = *string) != EOS) { |
while ((test = FOLDCASE(*string, flags)) != EOS) { |
if (!fnmatch(pattern, string, flags & ~FNM_PERIOD)) |
int e; |
return (0); |
switch ((e = fnmatchx(pattern, string, |
|
flags & ~FNM_PERIOD, recursion))) { |
|
case FNM_NOMATCH: |
|
break; |
|
default: |
|
return e; |
|
} |
if (test == '/' && flags & FNM_PATHNAME) |
if (test == '/' && flags & FNM_PATHNAME) |
break; |
break; |
++string; |
++string; |
} |
} |
return (FNM_NOMATCH); |
return FNM_NOMATCH; |
case '[': |
case '[': |
if (*string == EOS) |
if (*string == EOS) |
return (FNM_NOMATCH); |
return FNM_NOMATCH; |
if (*string == '/' && flags & FNM_PATHNAME) |
if (*string == '/' && flags & FNM_PATHNAME) |
return (FNM_NOMATCH); |
return FNM_NOMATCH; |
if ((pattern = |
if ((pattern = rangematch(pattern, |
rangematch(pattern, *string, flags)) == NULL) |
FOLDCASE(*string, flags), flags)) == NULL) |
return (FNM_NOMATCH); |
return FNM_NOMATCH; |
++string; |
++string; |
break; |
break; |
case '\\': |
case '\\': |
if (!(flags & FNM_NOESCAPE)) { |
if (!(flags & FNM_NOESCAPE)) { |
if ((c = *pattern++) == EOS) { |
if ((c = FOLDCASE(*pattern++, flags)) == EOS) { |
c = '\\'; |
c = '\\'; |
--pattern; |
--pattern; |
} |
} |
} |
} |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
default: |
default: |
if (c != *string++) |
if (c != FOLDCASE(*string++, flags)) |
return (FNM_NOMATCH); |
return FNM_NOMATCH; |
break; |
break; |
} |
} |
|
} |
/* NOTREACHED */ |
/* NOTREACHED */ |
} |
} |
|
|
static const char * |
int |
rangematch(pattern, test, flags) |
fnmatch(const char *pattern, const char *string, int flags) |
const char *pattern; |
|
int test, flags; |
|
{ |
{ |
int negate, ok; |
return fnmatchx(pattern, string, flags, 64); |
char c, c2; |
|
|
|
/* |
|
* A bracket expression starting with an unquoted circumflex |
|
* character produces unspecified results (IEEE 1003.2-1992, |
|
* 3.13.2). This implementation treats it like '!', for |
|
* consistency with the regular expression syntax. |
|
* J.T. Conklin (conklin@ngai.kaleida.com) |
|
*/ |
|
if (negate = (*pattern == '!' || *pattern == '^')) |
|
++pattern; |
|
|
|
for (ok = 0; (c = *pattern++) != ']';) { |
|
if (c == '\\' && !(flags & FNM_NOESCAPE)) |
|
c = *pattern++; |
|
if (c == EOS) |
|
return (NULL); |
|
if (*pattern == '-' |
|
&& (c2 = *(pattern+1)) != EOS && c2 != ']') { |
|
pattern += 2; |
|
if (c2 == '\\' && !(flags & FNM_NOESCAPE)) |
|
c2 = *pattern++; |
|
if (c2 == EOS) |
|
return (NULL); |
|
if (c <= test && test <= c2) |
|
ok = 1; |
|
} else if (c == test) |
|
ok = 1; |
|
} |
|
return (ok == negate ? NULL : pattern); |
|
} |
} |