mirror of
https://sourceware.org/git/glibc.git
synced 2024-11-26 06:50:07 +00:00
95 lines
2.6 KiB
C
95 lines
2.6 KiB
C
|
/* Turkish regular expression tests.
|
||
|
|
Copyright (C) 2002, 2003 Free Software Foundation, Inc.
|
||
|
|
This file is part of the GNU C Library.
|
||
|
|
Contributed by Jakub Jelinek <jakub@redhat.com>, 2002.
|
||
|
|
|
||
|
|
The GNU C Library is free software; you can redistribute it and/or
|
||
|
|
modify it under the terms of the GNU Lesser General Public
|
||
|
|
License as published by the Free Software Foundation; either
|
||
|
|
version 2.1 of the License, or (at your option) any later version.
|
||
|
|
|
||
|
|
The GNU C Library is distributed in the hope that it will be useful,
|
||
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||
|
|
Lesser General Public License for more details.
|
||
|
|
|
||
|
|
You should have received a copy of the GNU Lesser General Public
|
||
|
|
License along with the GNU C Library; if not, write to the Free
|
||
|
|
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
||
|
|
02111-1307 USA. */
|
||
|
|
|
||
|
|
#include <sys/types.h>
|
||
|
|
#include <mcheck.h>
|
||
|
|
#include <regex.h>
|
||
|
|
#include <stdio.h>
|
||
|
|
#include <stdlib.h>
|
||
|
|
#include <locale.h>
|
||
|
|
|
||
|
|
/* Tests supposed to match. */
|
||
|
|
struct
|
||
|
|
{
|
||
|
|
const char *pattern;
|
||
|
|
const char *string;
|
||
|
|
int flags, nmatch;
|
||
|
|
regmatch_t rm[5];
|
||
|
|
} tests[] = {
|
||
|
|
/* \xc4\xb0 LATIN CAPITAL LETTER I WITH DOT ABOVE
|
||
|
|
\xc4\xb1 LATIN SMALL LETTER DOTLESS I */
|
||
|
|
#if 0
|
||
|
|
/* XXX Not used since they fail so far. */
|
||
|
|
{ "\xc4\xb0I*\xc4\xb1$", "aBi\xc4\xb1\xc4\xb1I", REG_ICASE, 2,
|
||
|
|
{ { 2, 8 }, { -1, -1 } } },
|
||
|
|
{ "[\xc4\xb0x]I*\xc4\xb1$", "aBi\xc4\xb1\xc4\xb1I", REG_ICASE, 2,
|
||
|
|
{ { 2, 8 }, { -1, -1 } } },
|
||
|
|
{ "[^x]I*\xc4\xb1$", "aBi\xc4\xb1\xc4\xb1I", REG_ICASE, 2,
|
||
|
|
{ { 2, 8 }, { -1, -1 } } }
|
||
|
|
#endif
|
||
|
|
};
|
||
|
|
|
||
|
|
int
|
||
|
|
main (void)
|
||
|
|
{
|
||
|
|
regex_t re;
|
||
|
|
regmatch_t rm[5];
|
||
|
|
size_t i;
|
||
|
|
int n, ret = 0;
|
||
|
|
|
||
|
|
setlocale (LC_ALL, "tr_TR.UTF-8");
|
||
|
|
for (i = 0; i < sizeof (tests) / sizeof (tests[0]); ++i)
|
||
|
|
{
|
||
|
|
n = regcomp (&re, tests[i].pattern, tests[i].flags);
|
||
|
|
if (n != 0)
|
||
|
|
{
|
||
|
|
char buf[500];
|
||
|
|
regerror (n, &re, buf, sizeof (buf));
|
||
|
|
printf ("regcomp %zd failed: %s\n", i, buf);
|
||
|
|
ret = 1;
|
||
|
|
continue;
|
||
|
|
}
|
||
|
|
|
||
|
|
if (regexec (&re, tests[i].string, tests[i].nmatch, rm, 0))
|
||
|
|
{
|
||
|
|
printf ("regexec %zd failed\n", i);
|
||
|
|
ret = 1;
|
||
|
|
regfree (&re);
|
||
|
|
continue;
|
||
|
|
}
|
||
|
|
|
||
|
|
for (n = 0; n < tests[i].nmatch; ++n)
|
||
|
|
if (rm[n].rm_so != tests[i].rm[n].rm_so
|
||
|
|
|| rm[n].rm_eo != tests[i].rm[n].rm_eo)
|
||
|
|
{
|
||
|
|
if (tests[i].rm[n].rm_so == -1 && tests[i].rm[n].rm_eo == -1)
|
||
|
|
break;
|
||
|
|
printf ("regexec match failure rm[%d] %d..%d\n",
|
||
|
|
n, rm[n].rm_so, rm[n].rm_eo);
|
||
|
|
ret = 1;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
|
||
|
|
regfree (&re);
|
||
|
|
}
|
||
|
|
|
||
|
|
return ret;
|
||
|
|
}
|