mirror of
https://sourceware.org/git/glibc.git
synced 2024-11-05 21:00:05 +00:00
94 lines
2.6 KiB
C
94 lines
2.6 KiB
C
/* Regular expression tests.
|
|
Copyright (C) 2002 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>
|
|
|
|
/* Tests supposed to match. */
|
|
struct
|
|
{
|
|
const char *pattern;
|
|
const char *string;
|
|
int flags, nmatch;
|
|
regmatch_t rm[5];
|
|
} tests[] = {
|
|
/* Test for newline handling in regex. */
|
|
{ "[^~]*~", "\nx~y", 0, 2, { { 0, 3 }, { -1, -1 } } },
|
|
/* Other tests. */
|
|
{ ".*|\\([KIO]\\)\\([^|]*\\).*|?[KIO]", "10~.~|P|K0|I10|O16|?KSb", 0, 3,
|
|
{ { 0, 21 }, { 15, 16 }, { 16, 18 } } },
|
|
{ ".*|\\([KIO]\\)\\([^|]*\\).*|?\\1", "10~.~|P|K0|I10|O16|?KSb", 0, 3,
|
|
{ { 0, 21 }, { 8, 9 }, { 9, 10 } } },
|
|
{ "^\\(a*\\)\\1\\{9\\}\\(a\\{0,9\\}\\)\\([0-9]*;.*[^a]\\2\\([0-9]\\)\\)",
|
|
"a1;;0a1aa2aaa3aaaa4aaaaa5aaaaaa6aaaaaaa7aaaaaaaa8aaaaaaaaa9aa2aa1a0", 0,
|
|
5, { { 0, 67 }, { 0, 0 }, { 0, 1 }, { 1, 67 }, { 66, 67 } } }
|
|
};
|
|
|
|
int
|
|
main (void)
|
|
{
|
|
regex_t re;
|
|
regmatch_t rm[5];
|
|
size_t i;
|
|
int n, ret = 0;
|
|
|
|
mtrace ();
|
|
|
|
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;
|
|
}
|