/*
* Copyright (c) 1989, 1993, 1994
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Guido van Rossum.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 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
* 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
* SUCH DAMAGE.
*/
/*
* Copyright 2013 Garrett D'Amore <garrett@damore.org>
* Copyright 2010 Nexenta Systems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/*
* Function fnmatch() as specified in POSIX 1003.2-1992, section B.6.
* Compares a filename or pathname to a pattern.
*/
/*
* Some notes on multibyte character support:
* 1. Patterns with illegal byte sequences match nothing.
* 2. Illegal byte sequences in the "string" argument are handled by treating
* them as single-byte characters with a value of the first byte of the
* sequence cast to wchar_t.
* 3. Multibyte conversion state objects (mbstate_t) are passed around and
* used for most, but not all, conversions. Further work will be required
* to support state-dependent encodings.
*/
#include "lint.h"
#include <fnmatch.h>
#include <limits.h>
#include <string.h>
#include <wchar.h>
#include <xlocale.h>
#include <wctype.h>
#include "localeimpl.h"
#include "collate.h"
#define RANGE_NOMATCH 0
locale_t);
int
int flags;
{
loc));
}
static int
{
char *newp;
char c;
for (;;) {
return (FNM_NOMATCH);
sclen = 1;
}
switch (pc) {
case EOS:
/*
* Removed FNM_LEADING_DIR, as it is not present
* on Solaris.
*/
case '?':
return (FNM_NOMATCH);
return (FNM_NOMATCH);
(string == stringstart ||
return (FNM_NOMATCH);
break;
case '*':
c = *pattern;
/* Collapse multiple stars. */
while (c == '*')
c = *++pattern;
(string == stringstart ||
return (FNM_NOMATCH);
/* Optimize for pattern with * at end or before /. */
if (c == EOS)
if (flags & FNM_PATHNAME)
0 : FNM_NOMATCH);
else
return (0);
return (FNM_NOMATCH);
break;
}
/* General case, use recursion. */
return (0);
sclen = 1;
sizeof (strmbs));
}
break;
}
return (FNM_NOMATCH);
case '[':
return (FNM_NOMATCH);
return (FNM_NOMATCH);
(string == stringstart ||
return (FNM_NOMATCH);
case RANGE_ERROR:
goto norm;
case RANGE_MATCH:
break;
case RANGE_NOMATCH:
return (FNM_NOMATCH);
}
break;
case '\\':
if (!(flags & FNM_NOESCAPE)) {
return (FNM_NOMATCH);
if (pclen == 0)
pc = '\\';
}
/* FALLTHROUGH */
default:
norm:
else if ((flags & FNM_IGNORECASE) &&
else
return (FNM_NOMATCH);
break;
}
}
/* NOTREACHED */
}
static int
{
const char *origpat;
/*
* 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)
*/
++pattern;
if (flags & FNM_IGNORECASE)
/*
* A right bracket shall lose its special meaning and represent
* itself in a bracket expression if it occurs first in the list.
* -- POSIX.2 2.8.3.2
*/
ok = 0;
for (;;) {
pattern++;
break;
} else if (*pattern == '\0') {
return (RANGE_ERROR);
return (RANGE_NOMATCH);
pattern++;
return (RANGE_NOMATCH);
if (flags & FNM_IGNORECASE)
c = towlower_l(c, loc);
pattern++;
loc);
return (RANGE_NOMATCH);
return (RANGE_ERROR);
if (flags & FNM_IGNORECASE)
ok = 1;
} else if (c == test)
ok = 1;
}
}