version 1.7, 1993/11/09 18:22:09 |
version 1.11, 1995/02/27 03:43:06 |
|
|
|
/* $NetBSD$ */ |
|
|
/* |
/* |
* Copyright (c) 1989, 1993 |
* 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. |
* |
* |
* This code is derived from software contributed to Berkeley by |
* This code is derived from software contributed to Berkeley by |
|
|
*/ |
*/ |
|
|
#if defined(LIBC_SCCS) && !defined(lint) |
#if defined(LIBC_SCCS) && !defined(lint) |
/* from: static char sccsid[] = "@(#)fnmatch.c 8.1 (Berkeley) 6/4/93"; */ |
#if 0 |
static char *rcsid = "$Id$"; |
static char sccsid[] = "@(#)fnmatch.c 8.2 (Berkeley) 4/16/94"; |
|
#else |
|
static char rcsid[] = "$NetBSD$"; |
|
#endif |
#endif /* LIBC_SCCS and not lint */ |
#endif /* LIBC_SCCS and not lint */ |
|
|
/* |
/* |
Line 51 static char *rcsid = "$Id$"; |
|
Line 56 static char *rcsid = "$Id$"; |
|
|
|
static const char *rangematch __P((const char *, int, int)); |
static const char *rangematch __P((const char *, int, int)); |
|
|
|
int |
fnmatch(pattern, string, flags) |
fnmatch(pattern, string, flags) |
register const char *pattern, *string; |
const char *pattern, *string; |
int flags; |
int flags; |
{ |
{ |
register char c; |
const char *stringstart; |
char test; |
char c, test; |
|
|
for (;;) |
for (stringstart = string;;) |
switch (c = *pattern++) { |
switch (c = *pattern++) { |
case EOS: |
case EOS: |
return (*string == EOS ? 0 : FNM_NOMATCH); |
return (*string == EOS ? 0 : FNM_NOMATCH); |
case '?': |
case '?': |
if ((test = *string++) == EOS || |
if (*string == EOS) |
test == '/' && flags & FNM_PATHNAME) |
return (FNM_NOMATCH); |
|
if (*string == '/' && (flags & FNM_PATHNAME)) |
return (FNM_NOMATCH); |
return (FNM_NOMATCH); |
|
if (*string == '.' && (flags & FNM_PERIOD) && |
|
(string == stringstart || |
|
((flags & FNM_PATHNAME) && *(string - 1) == '/'))) |
|
return (FNM_NOMATCH); |
|
++string; |
break; |
break; |
case '*': |
case '*': |
c = *pattern; |
c = *pattern; |
Line 73 fnmatch(pattern, string, flags) |
|
Line 85 fnmatch(pattern, string, flags) |
|
while (c == '*') |
while (c == '*') |
c = *++pattern; |
c = *++pattern; |
|
|
|
if (*string == '.' && (flags & FNM_PERIOD) && |
|
(string == stringstart || |
|
((flags & FNM_PATHNAME) && *(string - 1) == '/'))) |
|
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 (index(string, '/') == NULL ? |
return (strchr(string, '/') == NULL ? |
0 : FNM_NOMATCH); |
0 : FNM_NOMATCH); |
else |
else |
return (0); |
return (0); |
else if (c == '/' && flags & FNM_PATHNAME) { |
else if (c == '/' && flags & FNM_PATHNAME) { |
if ((string = index(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 = *string) != EOS) { |
if (!fnmatch(pattern, string, flags)) |
if (!fnmatch(pattern, string, flags & ~FNM_PERIOD)) |
return (0); |
return (0); |
if (test == '/' && flags & FNM_PATHNAME) |
if (test == '/' && flags & FNM_PATHNAME) |
break; |
break; |
Line 96 fnmatch(pattern, string, flags) |
|
Line 113 fnmatch(pattern, string, flags) |
|
} |
} |
return (FNM_NOMATCH); |
return (FNM_NOMATCH); |
case '[': |
case '[': |
if ((test = *string++) == EOS || |
if (*string == EOS) |
test == '/' && flags & FNM_PATHNAME) |
return (FNM_NOMATCH); |
|
if (*string == '/' && flags & FNM_PATHNAME) |
return (FNM_NOMATCH); |
return (FNM_NOMATCH); |
if ((pattern = rangematch(pattern, test, flags)) == NULL) |
if ((pattern = |
|
rangematch(pattern, *string, flags)) == NULL) |
return (FNM_NOMATCH); |
return (FNM_NOMATCH); |
|
++string; |
break; |
break; |
case '\\': |
case '\\': |
if (!(flags & FNM_NOESCAPE)) { |
if (!(flags & FNM_NOESCAPE)) { |
Line 120 fnmatch(pattern, string, flags) |
|
Line 140 fnmatch(pattern, string, flags) |
|
|
|
static const char * |
static const char * |
rangematch(pattern, test, flags) |
rangematch(pattern, test, flags) |
register const char *pattern; |
const char *pattern; |
register int test; |
int test, flags; |
int flags; |
|
{ |
{ |
register char c, c2; |
|
int negate, ok; |
int negate, ok; |
|
char c, c2; |
|
|
/* A bracket expression starting with an unquoted circumflex |
/* |
|
* A bracket expression starting with an unquoted circumflex |
* character produces unspecified results (IEEE 1003.2-1992, |
* character produces unspecified results (IEEE 1003.2-1992, |
* 3.13.2). I have chosen to treat it like '!', for |
* 3.13.2). This implementation treats it like '!', for |
* consistancy with regular expression syntax. |
* consistency with the regular expression syntax. |
|
* J.T. Conklin (conklin@ngai.kaleida.com) |
*/ |
*/ |
if (negate = (*pattern == '!' || *pattern == '^')) { |
if (negate = (*pattern == '!' || *pattern == '^')) |
pattern++; |
++pattern; |
} |
|
|
|
for (ok = 0; (c = *pattern++) != ']';) { |
for (ok = 0; (c = *pattern++) != ']';) { |
if (c == '\\' && !(flags & FNM_NOESCAPE)) { |
if (c == '\\' && !(flags & FNM_NOESCAPE)) |
c = *pattern++; |
c = *pattern++; |
} |
if (c == EOS) |
if (c == EOS) { |
|
return (NULL); |
return (NULL); |
} |
|
|
|
if (*pattern == '-' |
if (*pattern == '-' |
&& (c2 = *(pattern+1)) != EOS && c2 != ']') { |
&& (c2 = *(pattern+1)) != EOS && c2 != ']') { |
pattern += 2; |
pattern += 2; |
if (c2 == '\\' && !(flags & FNM_NOESCAPE)) { |
if (c2 == '\\' && !(flags & FNM_NOESCAPE)) |
c2 = *pattern++; |
c2 = *pattern++; |
} |
if (c2 == EOS) |
if (c2 == EOS) { |
|
return (NULL); |
return (NULL); |
} |
if (c <= test && test <= c2) |
|
|
if (c <= test && test <= c2) { |
|
ok = 1; |
ok = 1; |
} |
} else if (c == test) |
} else if (c == test) { |
|
ok = 1; |
ok = 1; |
} |
|
} |
} |
|
|
return (ok == negate ? NULL : pattern); |
return (ok == negate ? NULL : pattern); |
} |
} |