-/* Copyright (C) 1991-1993,1996-1999,2000-2006 Free Software Foundation, Inc.
+/* Copyright (C) 1991,1992,1993,1996,1997,1998,1999,2000,2001,2002,2003,2004,2005,2006
+ Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
#if defined _LIBC || !defined __GNU_LIBRARY__ || !HAVE_FNMATCH_GNU
-# ifndef isblank
+# if ! (defined isblank || HAVE_DECL_ISBLANK)
# define isblank(c) ((c) == ' ' || (c) == '\t')
# endif
-# ifndef isgraph
-# define isgraph(c) (isprint (c) && !isspace (c))
-# endif
# define STREQ(s1, s2) ((strcmp (s1, s2) == 0))
# endif
/* Note that this evaluates C many times. */
-# ifdef _LIBC
-# define FOLD(c) ((flags & FNM_CASEFOLD) ? tolower (c) : (c))
-# else
-# define FOLD(c) ((flags & FNM_CASEFOLD) && isupper (c) ? tolower (c) : (c))
-# endif
+# define FOLD(c) ((flags & FNM_CASEFOLD) ? tolower (c) : (c))
# define CHAR char
# define UCHAR unsigned char
# define INT int
# define FCT internal_fnmatch
# define EXT ext_match
# define END end_pattern
-# define L(CS) CS
+# define L_(CS) CS
# ifdef _LIBC
# define BTOWC(C) __btowc (C)
# else
# define FCT internal_fnwmatch
# define EXT ext_wmatch
# define END end_wpattern
-# define L(CS) L##CS
+# define L_(CS) L##CS
# define BTOWC(C) (C)
# ifdef _LIBC
# define STRLEN(S) __wcslen (S)
wide characters. */
memset (&ps, '\0', sizeof (ps));
patsize = mbsrtowcs (NULL, &pattern, 0, &ps) + 1;
- if (__builtin_expect (patsize == 0, 0))
- /* Something wrong.
- XXX Do we have to set `errno' to something which mbsrtows hasn't
- already done? */
- return -1;
- assert (mbsinit (&ps));
- strsize = mbsrtowcs (NULL, &string, 0, &ps) + 1;
- if (__builtin_expect (strsize == 0, 0))
- /* Something wrong.
- XXX Do we have to set `errno' to something which mbsrtows hasn't
- already done? */
- return -1;
- assert (mbsinit (&ps));
- totsize = patsize + strsize;
- if (__builtin_expect (! (patsize <= totsize
- && totsize <= SIZE_MAX / sizeof (wchar_t)),
- 0))
+ if (__builtin_expect (patsize != 0, 1))
{
- errno = ENOMEM;
- return -1;
- }
-
- /* Allocate room for the wide characters. */
- if (__builtin_expect (totsize < ALLOCA_LIMIT, 1))
- wpattern = (wchar_t *) alloca (totsize * sizeof (wchar_t));
- else
- {
- wpattern = malloc (totsize * sizeof (wchar_t));
- if (__builtin_expect (! wpattern, 0))
+ assert (mbsinit (&ps));
+ strsize = mbsrtowcs (NULL, &string, 0, &ps) + 1;
+ if (__builtin_expect (strsize != 0, 1))
{
- errno = ENOMEM;
- return -1;
+ assert (mbsinit (&ps));
+ totsize = patsize + strsize;
+ if (__builtin_expect (! (patsize <= totsize
+ && totsize <= SIZE_MAX / sizeof (wchar_t)),
+ 0))
+ {
+ errno = ENOMEM;
+ return -1;
+ }
+
+ /* Allocate room for the wide characters. */
+ if (__builtin_expect (totsize < ALLOCA_LIMIT, 1))
+ wpattern = (wchar_t *) alloca (totsize * sizeof (wchar_t));
+ else
+ {
+ wpattern = malloc (totsize * sizeof (wchar_t));
+ if (__builtin_expect (! wpattern, 0))
+ {
+ errno = ENOMEM;
+ return -1;
+ }
+ }
+ wstring = wpattern + patsize;
+
+ /* Convert the strings into wide characters. */
+ mbsrtowcs (wpattern, &pattern, patsize, &ps);
+ assert (mbsinit (&ps));
+ mbsrtowcs (wstring, &string, strsize, &ps);
+
+ res = internal_fnwmatch (wpattern, wstring, wstring + strsize - 1,
+ flags & FNM_PERIOD, flags);
+
+ if (__builtin_expect (! (totsize < ALLOCA_LIMIT), 0))
+ free (wpattern);
+ return res;
}
}
- wstring = wpattern + patsize;
-
- /* Convert the strings into wide characters. */
- mbsrtowcs (wpattern, &pattern, patsize, &ps);
- assert (mbsinit (&ps));
- mbsrtowcs (wstring, &string, strsize, &ps);
-
- res = internal_fnwmatch (wpattern, wstring, wstring + strsize - 1,
- flags & FNM_PERIOD, flags);
-
- if (__builtin_expect (! (totsize < ALLOCA_LIMIT), 0))
- free (wpattern);
- return res;
}
+
# endif /* HANDLE_MULTIBYTE */
return internal_fnmatch (pattern, string, string + strlen (string),
-/* Copyright (C) 1991-1993,1996-1999,2000-2004,2006
+/* Copyright (C) 1991,1992,1993,1996,1997,1998,1999,2000,2001,2002,2003,2004,2005,2006
Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
along with this program; if not, write to the Free Software Foundation,
Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */
-/* Match STRING against the filename pattern PATTERN, returning zero if
+/* Match STRING against the file name pattern PATTERN, returning zero if
it matches, nonzero if not. */
static int EXT (INT opt, const CHAR *pattern, const CHAR *string,
const CHAR *string_end, bool no_leading_period, int flags)
# endif
#endif
- while ((c = *p++) != L('\0'))
+ while ((c = *p++) != L_('\0'))
{
bool new_no_leading_period = false;
c = FOLD (c);
switch (c)
{
- case L('?'):
+ case L_('?'):
if (__builtin_expect (flags & FNM_EXTMATCH, 0) && *p == '(')
{
int res;
if (n == string_end)
return FNM_NOMATCH;
- else if (*n == L('/') && (flags & FNM_FILE_NAME))
+ else if (*n == L_('/') && (flags & FNM_FILE_NAME))
return FNM_NOMATCH;
- else if (*n == L('.') && no_leading_period)
+ else if (*n == L_('.') && no_leading_period)
return FNM_NOMATCH;
break;
- case L('\\'):
+ case L_('\\'):
if (!(flags & FNM_NOESCAPE))
{
c = *p++;
- if (c == L('\0'))
+ if (c == L_('\0'))
/* Trailing \ loses. */
return FNM_NOMATCH;
c = FOLD (c);
return FNM_NOMATCH;
break;
- case L('*'):
+ case L_('*'):
if (__builtin_expect (flags & FNM_EXTMATCH, 0) && *p == '(')
{
int res;
return res;
}
- if (n != string_end && *n == L('.') && no_leading_period)
+ if (n != string_end && *n == L_('.') && no_leading_period)
return FNM_NOMATCH;
- for (c = *p++; c == L('?') || c == L('*'); c = *p++)
+ for (c = *p++; c == L_('?') || c == L_('*'); c = *p++)
{
- if (*p == L('(') && (flags & FNM_EXTMATCH) != 0)
+ if (*p == L_('(') && (flags & FNM_EXTMATCH) != 0)
{
const CHAR *endp = END (p);
if (endp != p)
}
}
- if (c == L('?'))
+ if (c == L_('?'))
{
/* A ? needs to match one character. */
if (n == string_end)
/* There isn't another character; no match. */
return FNM_NOMATCH;
- else if (*n == L('/')
+ else if (*n == L_('/')
&& __builtin_expect (flags & FNM_FILE_NAME, 0))
/* A slash does not match a wildcard under
FNM_FILE_NAME. */
}
}
- if (c == L('\0'))
+ if (c == L_('\0'))
/* The wildcard(s) is/are the last element of the pattern.
If the name is a file name and contains another slash
this means it cannot match, unless the FNM_LEADING_DIR
result = 0;
else
{
- if (MEMCHR (n, L('/'), string_end - n) == NULL)
+ if (MEMCHR (n, L_('/'), string_end - n) == NULL)
result = 0;
}
}
{
const CHAR *endp;
- endp = MEMCHR (n, (flags & FNM_FILE_NAME) ? L('/') : L('\0'),
+ endp = MEMCHR (n, (flags & FNM_FILE_NAME) ? L_('/') : L_('\0'),
string_end - n);
if (endp == NULL)
endp = string_end;
- if (c == L('[')
+ if (c == L_('[')
|| (__builtin_expect (flags & FNM_EXTMATCH, 0) != 0
- && (c == L('@') || c == L('+') || c == L('!'))
- && *p == L('(')))
+ && (c == L_('@') || c == L_('+') || c == L_('!'))
+ && *p == L_('(')))
{
int flags2 = ((flags & FNM_FILE_NAME)
? flags : (flags & ~FNM_PERIOD));
== 0)
return 0;
}
- else if (c == L('/') && (flags & FNM_FILE_NAME))
+ else if (c == L_('/') && (flags & FNM_FILE_NAME))
{
- while (n < string_end && *n != L('/'))
+ while (n < string_end && *n != L_('/'))
++n;
- if (n < string_end && *n == L('/')
+ if (n < string_end && *n == L_('/')
&& (FCT (p, n + 1, string_end, flags & FNM_PERIOD, flags)
== 0))
return 0;
? flags : (flags & ~FNM_PERIOD));
int no_leading_period2 = no_leading_period;
- if (c == L('\\') && !(flags & FNM_NOESCAPE))
+ if (c == L_('\\') && !(flags & FNM_NOESCAPE))
c = *p;
c = FOLD (c);
for (--p; n < endp; ++n, no_leading_period2 = false)
/* If we come here no match is possible with the wildcard. */
return FNM_NOMATCH;
- case L('['):
+ case L_('['):
{
/* Nonzero if the sense of the character class is inverted. */
register bool not;
if (n == string_end)
return FNM_NOMATCH;
- if (*n == L('.') && no_leading_period)
+ if (*n == L_('.') && no_leading_period)
return FNM_NOMATCH;
- if (*n == L('/') && (flags & FNM_FILE_NAME))
+ if (*n == L_('/') && (flags & FNM_FILE_NAME))
/* `/' cannot be matched. */
return FNM_NOMATCH;
- not = (*p == L('!') || (posixly_correct < 0 && *p == L('^')));
+ not = (*p == L_('!') || (posixly_correct < 0 && *p == L_('^')));
if (not)
++p;
c = *p++;
for (;;)
{
- if (!(flags & FNM_NOESCAPE) && c == L('\\'))
+ if (!(flags & FNM_NOESCAPE) && c == L_('\\'))
{
- if (*p == L('\0'))
+ if (*p == L_('\0'))
return FNM_NOMATCH;
c = FOLD ((UCHAR) *p);
++p;
if (c == fn)
goto matched;
}
- else if (c == L('[') && *p == L(':'))
+ else if (c == L_('[') && *p == L_(':'))
{
/* Leave room for the null. */
CHAR str[CHAR_CLASS_MAX_LENGTH + 1];
return FNM_NOMATCH;
c = *++p;
- if (c == L(':') && p[1] == L(']'))
+ if (c == L_(':') && p[1] == L_(']'))
{
p += 2;
break;
}
- if (c < L('a') || c >= L('z'))
+ if (c < L_('a') || c >= L_('z'))
{
/* This cannot possibly be a character class name.
Match it as a normal range. */
p = startp;
- c = L('[');
+ c = L_('[');
goto normal_bracket;
}
str[c1++] = c;
}
- str[c1] = L('\0');
+ str[c1] = L_('\0');
#if defined _LIBC || WIDE_CHAR_SUPPORT
wt = IS_CHAR_CLASS (str);
goto matched;
# endif
#else
- if ((STREQ (str, L("alnum")) && isalnum ((UCHAR) *n))
- || (STREQ (str, L("alpha")) && isalpha ((UCHAR) *n))
- || (STREQ (str, L("blank")) && isblank ((UCHAR) *n))
- || (STREQ (str, L("cntrl")) && iscntrl ((UCHAR) *n))
- || (STREQ (str, L("digit")) && isdigit ((UCHAR) *n))
- || (STREQ (str, L("graph")) && isgraph ((UCHAR) *n))
- || (STREQ (str, L("lower")) && islower ((UCHAR) *n))
- || (STREQ (str, L("print")) && isprint ((UCHAR) *n))
- || (STREQ (str, L("punct")) && ispunct ((UCHAR) *n))
- || (STREQ (str, L("space")) && isspace ((UCHAR) *n))
- || (STREQ (str, L("upper")) && isupper ((UCHAR) *n))
- || (STREQ (str, L("xdigit")) && isxdigit ((UCHAR) *n)))
+ if ((STREQ (str, L_("alnum")) && isalnum ((UCHAR) *n))
+ || (STREQ (str, L_("alpha")) && isalpha ((UCHAR) *n))
+ || (STREQ (str, L_("blank")) && isblank ((UCHAR) *n))
+ || (STREQ (str, L_("cntrl")) && iscntrl ((UCHAR) *n))
+ || (STREQ (str, L_("digit")) && isdigit ((UCHAR) *n))
+ || (STREQ (str, L_("graph")) && isgraph ((UCHAR) *n))
+ || (STREQ (str, L_("lower")) && islower ((UCHAR) *n))
+ || (STREQ (str, L_("print")) && isprint ((UCHAR) *n))
+ || (STREQ (str, L_("punct")) && ispunct ((UCHAR) *n))
+ || (STREQ (str, L_("space")) && isspace ((UCHAR) *n))
+ || (STREQ (str, L_("upper")) && isupper ((UCHAR) *n))
+ || (STREQ (str, L_("xdigit")) && isxdigit ((UCHAR) *n)))
goto matched;
#endif
c = *p++;
}
#ifdef _LIBC
- else if (c == L('[') && *p == L('='))
+ else if (c == L_('[') && *p == L_('='))
{
UCHAR str[1];
uint32_t nrules =
const CHAR *startp = p;
c = *++p;
- if (c == L('\0'))
+ if (c == L_('\0'))
{
p = startp;
- c = L('[');
+ c = L_('[');
goto normal_bracket;
}
str[0] = c;
c = *++p;
- if (c != L('=') || p[1] != L(']'))
+ if (c != L_('=') || p[1] != L_(']'))
{
p = startp;
- c = L('[');
+ c = L_('[');
goto normal_bracket;
}
p += 2;
c = *p++;
}
#endif
- else if (c == L('\0'))
+ else if (c == L_('\0'))
/* [ (unterminated) loses. */
return FNM_NOMATCH;
else
#ifdef _LIBC
bool is_seqval = false;
- if (c == L('[') && *p == L('.'))
+ if (c == L_('[') && *p == L_('.'))
{
uint32_t nrules =
_NL_CURRENT_WORD (LC_COLLATE, _NL_COLLATE_NRULES);
while (1)
{
c = *++p;
- if (c == L('.') && p[1] == L(']'))
+ if (c == L_('.') && p[1] == L_(']'))
{
p += 2;
break;
/* We have to handling the symbols differently in
ranges since then the collation sequence is
important. */
- is_range = *p == L('-') && p[1] != L('\0');
+ is_range = *p == L_('-') && p[1] != L_('\0');
if (nrules == 0)
{
/* We have to handling the symbols differently in
ranges since then the collation sequence is
important. */
- is_range = (*p == L('-') && p[1] != L('\0')
- && p[1] != L(']'));
+ is_range = (*p == L_('-') && p[1] != L_('\0')
+ && p[1] != L_(']'));
if (!is_range && c == fn)
goto matched;
c = *p++;
}
- if (c == L('-') && *p != L(']'))
+ if (c == L_('-') && *p != L_(']'))
{
#if _LIBC
/* We have to find the collation sequence
# endif
is_seqval = false;
- if (cend == L('[') && *p == L('.'))
+ if (cend == L_('[') && *p == L_('.'))
{
uint32_t nrules =
_NL_CURRENT_WORD (LC_COLLATE,
while (1)
{
c = *++p;
- if (c == L('.') && p[1] == L(']'))
+ if (c == L_('.') && p[1] == L_(']'))
{
p += 2;
break;
}
else
{
- if (!(flags & FNM_NOESCAPE) && cend == L('\\'))
+ if (!(flags & FNM_NOESCAPE) && cend == L_('\\'))
cend = *p++;
- if (cend == L('\0'))
+ if (cend == L_('\0'))
return FNM_NOMATCH;
cend = FOLD (cend);
}
and sometimes fatal consequences. */
UCHAR cend = *p++;
- if (!(flags & FNM_NOESCAPE) && cend == L('\\'))
+ if (!(flags & FNM_NOESCAPE) && cend == L_('\\'))
cend = *p++;
- if (cend == L('\0'))
+ if (cend == L_('\0'))
return FNM_NOMATCH;
/* It is a range. */
}
}
- if (c == L(']'))
+ if (c == L_(']'))
break;
}
ignore_next:
c = *p++;
- if (c == L('\0'))
+ if (c == L_('\0'))
/* [... (unterminated) loses. */
return FNM_NOMATCH;
- if (!(flags & FNM_NOESCAPE) && c == L('\\'))
+ if (!(flags & FNM_NOESCAPE) && c == L_('\\'))
{
- if (*p == L('\0'))
+ if (*p == L_('\0'))
return FNM_NOMATCH;
/* XXX 1003.2d11 is unclear if this is right. */
++p;
}
- else if (c == L('[') && *p == L(':'))
+ else if (c == L_('[') && *p == L_(':'))
{
int c1 = 0;
const CHAR *startp = p;
if (++c1 == CHAR_CLASS_MAX_LENGTH)
return FNM_NOMATCH;
- if (*p == L(':') && p[1] == L(']'))
+ if (*p == L_(':') && p[1] == L_(']'))
break;
- if (c < L('a') || c >= L('z'))
+ if (c < L_('a') || c >= L_('z'))
{
p = startp;
goto ignore_next;
p += 2;
c = *p++;
}
- else if (c == L('[') && *p == L('='))
+ else if (c == L_('[') && *p == L_('='))
{
c = *++p;
- if (c == L('\0'))
+ if (c == L_('\0'))
return FNM_NOMATCH;
c = *++p;
- if (c != L('=') || p[1] != L(']'))
+ if (c != L_('=') || p[1] != L_(']'))
return FNM_NOMATCH;
p += 2;
c = *p++;
}
- else if (c == L('[') && *p == L('.'))
+ else if (c == L_('[') && *p == L_('.'))
{
++p;
while (1)
if (c == '\0')
return FNM_NOMATCH;
- if (*p == L('.') && p[1] == L(']'))
+ if (*p == L_('.') && p[1] == L_(']'))
break;
}
p += 2;
c = *p++;
}
}
- while (c != L(']'));
+ while (c != L_(']'));
if (not)
return FNM_NOMATCH;
}
break;
- case L('+'):
- case L('@'):
- case L('!'):
+ case L_('+'):
+ case L_('@'):
+ case L_('!'):
if (__builtin_expect (flags & FNM_EXTMATCH, 0) && *p == '(')
{
int res;
}
goto normal_match;
- case L('/'):
+ case L_('/'):
if (NO_LEADING_PERIOD (flags))
{
if (n == string_end || c != (UCHAR) *n)
if (n == string_end)
return 0;
- if ((flags & FNM_LEADING_DIR) && n != string_end && *n == L('/'))
+ if ((flags & FNM_LEADING_DIR) && n != string_end && *n == L_('/'))
/* The FNM_LEADING_DIR flag says that "foo*" matches "foobar/frobozz". */
return 0;
const CHAR *p = pattern;
while (1)
- if (*++p == L('\0'))
+ if (*++p == L_('\0'))
/* This is an invalid pattern. */
return pattern;
- else if (*p == L('['))
+ else if (*p == L_('['))
{
/* Handle brackets special. */
if (posixly_correct == 0)
/* Skip the not sign. We have to recognize it because of a possibly
following ']'. */
- if (*++p == L('!') || (posixly_correct < 0 && *p == L('^')))
+ if (*++p == L_('!') || (posixly_correct < 0 && *p == L_('^')))
++p;
/* A leading ']' is recognized as such. */
- if (*p == L(']'))
+ if (*p == L_(']'))
++p;
/* Skip over all characters of the list. */
- while (*p != L(']'))
- if (*p++ == L('\0'))
+ while (*p != L_(']'))
+ if (*p++ == L_('\0'))
/* This is no valid pattern. */
return pattern;
}
- else if ((*p == L('?') || *p == L('*') || *p == L('+') || *p == L('@')
- || *p == L('!')) && p[1] == L('('))
+ else if ((*p == L_('?') || *p == L_('*') || *p == L_('+') || *p == L_('@')
+ || *p == L_('!')) && p[1] == L_('('))
p = END (p + 1);
- else if (*p == L(')'))
+ else if (*p == L_(')'))
break;
return p + 1;
/* Parse the pattern. Store the individual parts in the list. */
level = 0;
for (startp = p = pattern + 1; ; ++p)
- if (*p == L('\0'))
+ if (*p == L_('\0'))
/* This is an invalid pattern. */
return -1;
- else if (*p == L('['))
+ else if (*p == L_('['))
{
/* Handle brackets special. */
if (posixly_correct == 0)
/* Skip the not sign. We have to recognize it because of a possibly
following ']'. */
- if (*++p == L('!') || (posixly_correct < 0 && *p == L('^')))
+ if (*++p == L_('!') || (posixly_correct < 0 && *p == L_('^')))
++p;
/* A leading ']' is recognized as such. */
- if (*p == L(']'))
+ if (*p == L_(']'))
++p;
/* Skip over all characters of the list. */
- while (*p != L(']'))
- if (*p++ == L('\0'))
+ while (*p != L_(']'))
+ if (*p++ == L_('\0'))
/* This is no valid pattern. */
return -1;
}
- else if ((*p == L('?') || *p == L('*') || *p == L('+') || *p == L('@')
- || *p == L('!')) && p[1] == L('('))
+ else if ((*p == L_('?') || *p == L_('*') || *p == L_('+') || *p == L_('@')
+ || *p == L_('!')) && p[1] == L_('('))
/* Remember the nesting level. */
++level;
- else if (*p == L(')'))
+ else if (*p == L_(')'))
{
if (level-- == 0)
{
size_t plensize; \
size_t newpsize; \
\
- plen = (opt == L('?') || opt == L('@') \
+ plen = (opt == L_('?') || opt == L_('@') \
? pattern_len \
: p - startp + 1); \
plensize = plen * sizeof (CHAR); \
|| ALLOCA_LIMIT <= newpsize) \
return -1; \
newp = (struct patternlist *) alloca (newpsize); \
- *((CHAR *) MEMPCPY (newp->str, startp, p - startp)) = L('\0'); \
+ *((CHAR *) MEMPCPY (newp->str, startp, p - startp)) = L_('\0'); \
newp->next = NULL; \
*lastp = newp; \
lastp = &newp->next
break;
}
}
- else if (*p == L('|'))
+ else if (*p == L_('|'))
{
if (level == 0)
{
}
}
assert (list != NULL);
- assert (p[-1] == L(')'));
+ assert (p[-1] == L_(')'));
#undef NEW_PATTERN
switch (opt)
{
- case L('*'):
+ case L_('*'):
if (FCT (p, string, string_end, no_leading_period, flags) == 0)
return 0;
/* FALLTHROUGH */
- case L('+'):
+ case L_('+'):
do
{
for (rs = string; rs <= string_end; ++rs)
/* None of the patterns lead to a match. */
return FNM_NOMATCH;
- case L('?'):
+ case L_('?'):
if (FCT (p, string, string_end, no_leading_period, flags) == 0)
return 0;
/* FALLTHROUGH */
- case L('@'):
+ case L_('@'):
do
/* I cannot believe it but `strcat' is actually acceptable
here. Match the entire string with the prefix from the
/* None of the patterns lead to a match. */
return FNM_NOMATCH;
- case L('!'):
+ case L_('!'):
for (rs = string; rs <= string_end; ++rs)
{
struct patternlist *runp;
#undef STRCOLL
#undef STRLEN
#undef STRCAT
-#undef L
+#undef L_
#undef BTOWC
projects / thirdparty / gettext.git / commitdiff
