* Copyright (c) 1989 The Regents of the University of California.
* This code is derived from software contributed to Berkeley by
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* 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
* without specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid
[] = "@(#)fnmatch.c 5.4 (Berkeley) 2/23/91";
#endif /* LIBC_SCCS and not lint */
* Function fnmatch() as proposed in Posix 1003.2 B.6 (rev. 9).
* Compares a filename or pathname to a pattern.
rangematch(pattern
, test
)
register char *pattern
, test
;
if (negate
= (*pattern
== '!'))
for (ok
= 0; (c
= *pattern
++) != ']';) {
return(NULL
); /* illegal pattern */
if (*pattern
== '-' && (c2
= pattern
[1]) != EOS
&& c2
!= ']') {
if (c
<= test
&& test
<= c2
)
return(ok
== negate
? NULL
: pattern
);
fnmatch(pattern
, string
, flags
)
register const char *pattern
;
register const char *string
;
char test
, *rangematch();
switch (c
= *pattern
++) {
if ((test
= *string
++) == EOS
||
test
== '/' && flags
& FNM_PATHNAME
)
/* collapse multiple stars */
/* optimize for pattern with * at end or before / */
if (flags
& FNM_PATHNAME
)
return(!index(string
, '/'));
else if (c
== '/' && flags
& FNM_PATHNAME
) {
if ((string
= index(string
, '/')) == NULL
)
/* general case, use recursion */
while ((test
= *string
) != EOS
) {
if (fnmatch(pattern
, string
, flags
))
if (test
== '/' && flags
& FNM_PATHNAME
)
if ((test
= *string
++) == EOS
||
test
== '/' && flags
& FNM_PATHNAME
)
if ((pattern
= rangematch(pattern
, test
)) == NULL
)
if ((c
= *pattern
++) == EOS
) {