mirror of
https://git.savannah.gnu.org/git/gnulib.git
synced 2026-10-24 00:48:56 +03:00
5ab7a04761
Problem reported by Bruno Haible in: https://lists.gnu.org/r/bug-gnulib/2026-05/msg00137.html * tests/test-regex-en.c (tests, bug_regex11): Remove; unused. * tests/test-regex-en.c, tests/test-regex-tr.c, tests/test-regex.c: (main): Omit unused args.
435 lines
16 KiB
C
435 lines
16 KiB
C
/* Test regular expressions
|
|
Copyright 1996-2001, 2003-2026 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
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program 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 General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program. If not, see <https://www.gnu.org/licenses/>. */
|
|
|
|
#include <config.h>
|
|
|
|
#include "regex.h"
|
|
|
|
#include <ctype.h>
|
|
#include <limits.h>
|
|
#include <stdarg.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#if HAVE_DECL_ALARM
|
|
# include <unistd.h>
|
|
# include <signal.h>
|
|
#endif
|
|
|
|
static int exit_status;
|
|
|
|
static void
|
|
report_error (char const *format, ...)
|
|
{
|
|
va_list args;
|
|
va_start (args, format);
|
|
fprintf (stderr, "test-regex: ");
|
|
vfprintf (stderr, format, args);
|
|
fprintf (stderr, "\n");
|
|
va_end (args);
|
|
exit_status = 1;
|
|
}
|
|
|
|
/* Tests supposed to match; copied from glibc posix/bug-regex11.c. */
|
|
static struct
|
|
{
|
|
const char *pattern;
|
|
const char *string;
|
|
int flags, nmatch;
|
|
regmatch_t rm[5];
|
|
} const tests[] = {
|
|
/* Test for newline handling in regex. */
|
|
{ "[^~]*~", "\nx~y", 0, 2, { { 0, 3 }, { -1, -1 } } },
|
|
/* Other tests. */
|
|
{ "a(.*)b", "a b", REG_EXTENDED, 2, { { 0, 3 }, { 1, 2 } } },
|
|
{ ".*|\\([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 } } },
|
|
/* Test for BRE expression anchoring. POSIX says just that this may match;
|
|
in glibc regex it always matched, so avoid changing it. */
|
|
{ "\\(^\\|foo\\)bar", "bar", 0, 2, { { 0, 3 }, { -1, -1 } } },
|
|
{ "\\(foo\\|^\\)bar", "bar", 0, 2, { { 0, 3 }, { -1, -1 } } },
|
|
/* In ERE this must be treated as an anchor. */
|
|
{ "(^|foo)bar", "bar", REG_EXTENDED, 2, { { 0, 3 }, { -1, -1 } } },
|
|
{ "(foo|^)bar", "bar", REG_EXTENDED, 2, { { 0, 3 }, { -1, -1 } } },
|
|
/* Here ^ cannot be treated as an anchor according to POSIX. */
|
|
{ "(^|foo)bar", "(^|foo)bar", 0, 2, { { 0, 10 }, { -1, -1 } } },
|
|
{ "(foo|^)bar", "(foo|^)bar", 0, 2, { { 0, 10 }, { -1, -1 } } },
|
|
/* More tests on backreferences. */
|
|
{ "()\\1", "x", REG_EXTENDED, 2, { { 0, 0 }, { 0, 0 } } },
|
|
{ "()x\\1", "x", REG_EXTENDED, 2, { { 0, 1 }, { 0, 0 } } },
|
|
{ "()\\1*\\1*", "", REG_EXTENDED, 2, { { 0, 0 }, { 0, 0 } } },
|
|
{ "([0-9]).*\\1(a*)", "7;7a6", REG_EXTENDED, 3, { { 0, 4 }, { 0, 1 }, { 3, 4 } } },
|
|
{ "([0-9]).*\\1(a*)", "7;7a", REG_EXTENDED, 3, { { 0, 4 }, { 0, 1 }, { 3, 4 } } },
|
|
{ "(b)()c\\1", "bcb", REG_EXTENDED, 3, { { 0, 3 }, { 0, 1 }, { 1, 1 } } },
|
|
{ "()(b)c\\2", "bcb", REG_EXTENDED, 3, { { 0, 3 }, { 0, 0 }, { 0, 1 } } },
|
|
{ "a(b)()c\\1", "abcb", REG_EXTENDED, 3, { { 0, 4 }, { 1, 2 }, { 2, 2 } } },
|
|
{ "a()(b)c\\2", "abcb", REG_EXTENDED, 3, { { 0, 4 }, { 1, 1 }, { 1, 2 } } },
|
|
{ "()(b)\\1c\\2", "bcb", REG_EXTENDED, 3, { { 0, 3 }, { 0, 0 }, { 0, 1 } } },
|
|
{ "(b())\\2\\1", "bbbb", REG_EXTENDED, 3, { { 0, 2 }, { 0, 1 }, { 1, 1 } } },
|
|
{ "a()(b)\\1c\\2", "abcb", REG_EXTENDED, 3, { { 0, 4 }, { 1, 1 }, { 1, 2 } } },
|
|
{ "a()d(b)\\1c\\2", "adbcb", REG_EXTENDED, 3, { { 0, 5 }, { 1, 1 }, { 2, 3 } } },
|
|
{ "a(b())\\2\\1", "abbbb", REG_EXTENDED, 3, { { 0, 3 }, { 1, 2 }, { 2, 2 } } },
|
|
{ "(bb())\\2\\1", "bbbb", REG_EXTENDED, 3, { { 0, 4 }, { 0, 2 }, { 2, 2 } } },
|
|
{ "^([^,]*),\\1,\\1$", "a,a,a", REG_EXTENDED, 2, { { 0, 5 }, { 0, 1 } } },
|
|
{ "^([^,]*),\\1,\\1$", "ab,ab,ab", REG_EXTENDED, 2, { { 0, 8 }, { 0, 2 } } },
|
|
{ "^([^,]*),\\1,\\1,\\1$", "abc,abc,abc,abc", REG_EXTENDED, 2,
|
|
{ { 0, 15 }, { 0, 3 } } },
|
|
{ "^(.?)(.?)(.?)(.?)(.?).?\\5\\4\\3\\2\\1$",
|
|
"level", REG_NOSUB | REG_EXTENDED, 0, { { -1, -1 } } },
|
|
{ "^(.?)(.?)(.?)(.?)(.?)(.?)(.?)(.?)(.).?\\9\\8\\7\\6\\5\\4\\3\\2\\1$|^.?$",
|
|
"level", REG_NOSUB | REG_EXTENDED, 0, { { -1, -1 } } },
|
|
{ "^(.?)(.?)(.?)(.?)(.?)(.?)(.?)(.?)(.).?\\9\\8\\7\\6\\5\\4\\3\\2\\1$|^.?$",
|
|
"abcdedcba", REG_EXTENDED, 1, { { 0, 9 } } },
|
|
{ "^(.?)(.?)(.?)(.?)(.?)(.?)(.?)(.?)(.).?\\9\\8\\7\\6\\5\\4\\3\\2\\1$|^.?$",
|
|
"ababababa", REG_EXTENDED, 1, { { 0, 9 } } },
|
|
{ "^(.?)(.?)(.?)(.?)(.?)(.?)(.?)(.?)(.?).?\\9\\8\\7\\6\\5\\4\\3\\2\\1$",
|
|
"level", REG_NOSUB | REG_EXTENDED, 0, { { -1, -1 } } },
|
|
{ "^(.?)(.?)(.?)(.?)(.?)(.?)(.?)(.?)(.?).?\\9\\8\\7\\6\\5\\4\\3\\2\\1$",
|
|
"ababababa", REG_EXTENDED, 1, { { 0, 9 } } },
|
|
/* Test for *+ match. */
|
|
{ "^a*+(.)", "ab", REG_EXTENDED, 2, { { 0, 2 }, { 1, 2 } } },
|
|
/* Test for ** match. */
|
|
{ "^(a*)*(.)", "ab", REG_EXTENDED, 3, { { 0, 2 }, { 0, 1 }, { 1, 2 } } },
|
|
};
|
|
|
|
static void
|
|
bug_regex11 (void)
|
|
{
|
|
regex_t re;
|
|
regmatch_t rm[5];
|
|
|
|
for (size_t i = 0; i < sizeof (tests) / sizeof (tests[0]); ++i)
|
|
{
|
|
int err = regcomp (&re, tests[i].pattern, tests[i].flags);
|
|
if (err != 0)
|
|
{
|
|
char buf[500];
|
|
regerror (err, &re, buf, sizeof (buf));
|
|
report_error ("%s: regcomp %zd failed: %s", tests[i].pattern, i, buf);
|
|
continue;
|
|
}
|
|
|
|
if (regexec (&re, tests[i].string, tests[i].nmatch, rm, 0))
|
|
{
|
|
report_error ("%s: regexec %zd failed", tests[i].pattern, i);
|
|
regfree (&re);
|
|
continue;
|
|
}
|
|
|
|
for (int 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;
|
|
report_error ("%s: regexec %zd match failure rm[%d] %d..%d",
|
|
tests[i].pattern, i, n,
|
|
(int) rm[n].rm_so, (int) rm[n].rm_eo);
|
|
break;
|
|
}
|
|
|
|
regfree (&re);
|
|
}
|
|
}
|
|
|
|
int
|
|
main ()
|
|
{
|
|
struct re_pattern_buffer regex;
|
|
unsigned char folded_chars[UCHAR_MAX + 1];
|
|
const char *s;
|
|
struct re_registers regs;
|
|
|
|
#if HAVE_DECL_ALARM
|
|
/* In case a bug causes glibc to go into an infinite loop.
|
|
The tests should take less than 10 s on a reasonably modern CPU. */
|
|
int alarm_value = 1000;
|
|
signal (SIGALRM, SIG_DFL);
|
|
alarm (alarm_value);
|
|
#endif
|
|
|
|
bug_regex11 ();
|
|
|
|
/* This test is from glibc bug 3957, reported by Andrew Mackey. */
|
|
re_set_syntax (RE_SYNTAX_EGREP | RE_HAT_LISTS_NOT_NEWLINE);
|
|
memset (®ex, 0, sizeof regex);
|
|
static char const pat_3957[] = "a[^x]b";
|
|
s = re_compile_pattern (pat_3957, sizeof pat_3957 - 1, ®ex);
|
|
if (s)
|
|
report_error ("%s: %s", pat_3957, s);
|
|
else
|
|
{
|
|
/* This should fail, but succeeds for glibc-2.5. */
|
|
memset (®s, 0, sizeof regs);
|
|
static char const data[] = "a\nb";
|
|
int ret =
|
|
re_search (®ex, data, sizeof data - 1, 0, sizeof data - 1, ®s);
|
|
if (ret != -1)
|
|
report_error ("re_search '%s' on '%s' returned %d",
|
|
pat_3957, data, ret);
|
|
regfree (®ex);
|
|
free (regs.start);
|
|
free (regs.end);
|
|
}
|
|
|
|
/* This regular expression is from Spencer ere test number 75
|
|
in grep-2.3. */
|
|
re_set_syntax (RE_SYNTAX_POSIX_EGREP);
|
|
memset (®ex, 0, sizeof regex);
|
|
for (int i = 0; i <= UCHAR_MAX; i++)
|
|
folded_chars[i] = i;
|
|
regex.translate = folded_chars;
|
|
static char const pat75[] = "a[[:@:>@:]]b\n";
|
|
s = re_compile_pattern (pat75, sizeof pat75 - 1, ®ex);
|
|
/* This should fail with _Invalid character class name_ error. */
|
|
if (!s)
|
|
{
|
|
report_error ("re_compile_pattern: failed to reject '%s'", pat75);
|
|
regfree (®ex);
|
|
}
|
|
|
|
/* Ensure that [b-a] is diagnosed as invalid, when
|
|
using RE_NO_EMPTY_RANGES. */
|
|
re_set_syntax (RE_SYNTAX_POSIX_EGREP | RE_NO_EMPTY_RANGES);
|
|
memset (®ex, 0, sizeof regex);
|
|
static char const pat_b_a[] = "a[b-a]";
|
|
s = re_compile_pattern (pat_b_a, sizeof pat_b_a - 1, ®ex);
|
|
if (s == NULL)
|
|
{
|
|
report_error ("re_compile_pattern: failed to reject '%s'", pat_b_a);
|
|
regfree (®ex);
|
|
}
|
|
|
|
/* This should succeed, but does not for glibc-2.1.3. */
|
|
memset (®ex, 0, sizeof regex);
|
|
static char const pat_213[] = "{1";
|
|
s = re_compile_pattern (pat_213, sizeof pat_213 - 1, ®ex);
|
|
if (s)
|
|
report_error ("%s: %s", pat_213, s);
|
|
else
|
|
regfree (®ex);
|
|
|
|
/* The following example is derived from a problem report
|
|
against gawk from Jorge Stolfi <stolfi@ic.unicamp.br>. */
|
|
memset (®ex, 0, sizeof regex);
|
|
static char const pat_stolfi[] = "[an\371]*n";
|
|
s = re_compile_pattern (pat_stolfi, sizeof pat_stolfi - 1, ®ex);
|
|
if (s)
|
|
report_error ("%s: %s", pat_stolfi, s);
|
|
/* This should match, but does not for glibc-2.2.1. */
|
|
else
|
|
{
|
|
memset (®s, 0, sizeof regs);
|
|
static char const data[] = "an";
|
|
int ret = re_match (®ex, data, sizeof data - 1, 0, ®s);
|
|
if (ret != 2)
|
|
report_error ("re_match '%s' on '%s' at 2 returned %d",
|
|
pat_stolfi, data, ret);
|
|
regfree (®ex);
|
|
free (regs.start);
|
|
free (regs.end);
|
|
}
|
|
|
|
memset (®ex, 0, sizeof regex);
|
|
static char const pat_x[] = "x";
|
|
s = re_compile_pattern (pat_x, sizeof pat_x - 1, ®ex);
|
|
if (s)
|
|
report_error ("%s: %s", pat_x, s);
|
|
/* glibc-2.2.93 does not work with a negative RANGE argument. */
|
|
else
|
|
{
|
|
memset (®s, 0, sizeof regs);
|
|
static char const data[] = "wxy";
|
|
int ret = re_search (®ex, data, sizeof data - 1, 2, -2, ®s);
|
|
if (ret != 1)
|
|
report_error ("re_search '%s' on '%s' returned %d", pat_x, data, ret);
|
|
regfree (®ex);
|
|
free (regs.start);
|
|
free (regs.end);
|
|
}
|
|
|
|
/* The version of regex.c in older versions of gnulib
|
|
ignored RE_ICASE. Detect that problem too. */
|
|
re_set_syntax (RE_SYNTAX_EMACS | RE_ICASE);
|
|
memset (®ex, 0, sizeof regex);
|
|
s = re_compile_pattern (pat_x, 1, ®ex);
|
|
if (s)
|
|
report_error ("%s: %s", pat_x, s);
|
|
else
|
|
{
|
|
memset (®s, 0, sizeof regs);
|
|
static char const data[] = "WXY";
|
|
int ret = re_search (®ex, data, sizeof data - 1, 0, 3, ®s);
|
|
if (ret < 0)
|
|
report_error ("re_search '%s' on '%s' returned %d", pat_x, data, ret);
|
|
regfree (®ex);
|
|
free (regs.start);
|
|
free (regs.end);
|
|
}
|
|
|
|
/* glibc bug 11053. */
|
|
re_set_syntax (RE_SYNTAX_POSIX_BASIC);
|
|
memset (®ex, 0, sizeof regex);
|
|
static char const pat_sub2[] = "\\(a*\\)*a*\\1";
|
|
s = re_compile_pattern (pat_sub2, sizeof pat_sub2 - 1, ®ex);
|
|
if (s)
|
|
report_error ("%s: %s", pat_sub2, s);
|
|
else
|
|
{
|
|
memset (®s, 0, sizeof regs);
|
|
static char const data[] = "a";
|
|
int datalen = sizeof data - 1;
|
|
int ret = re_search (®ex, data, datalen, 0, datalen, ®s);
|
|
if (ret != 0)
|
|
report_error ("re_search '%s' on '%s' returned %d",
|
|
pat_sub2, data, ret);
|
|
else if (regs.num_regs < 2)
|
|
report_error ("re_search '%s' on '%s' returned only %d registers",
|
|
pat_sub2, data, (int) regs.num_regs);
|
|
else if (! (regs.start[0] == 0 && regs.end[0] == 1))
|
|
report_error ("re_search '%s' on '%s' returned wrong match [%d,%d)",
|
|
pat_sub2, data, (int) regs.start[0], (int) regs.end[0]);
|
|
else if (! (regs.start[1] == 0 && regs.end[1] == 0))
|
|
report_error ("re_search '%s' on '%s' returned wrong submatch [%d,%d)",
|
|
pat_sub2, data, (int) regs.start[1], (int) regs.end[1]);
|
|
regfree (®ex);
|
|
free (regs.start);
|
|
free (regs.end);
|
|
}
|
|
|
|
/* Catch a bug reported by Vin Shelton in
|
|
https://lists.gnu.org/r/bug-coreutils/2007-06/msg00089.html
|
|
*/
|
|
re_set_syntax (RE_SYNTAX_POSIX_BASIC
|
|
& ~RE_CONTEXT_INVALID_DUP
|
|
& ~RE_NO_EMPTY_RANGES);
|
|
static char const pat_shelton[] = "[[:alnum:]_-]\\\\+$";
|
|
s = re_compile_pattern (pat_shelton, sizeof pat_shelton - 1, ®ex);
|
|
if (s)
|
|
report_error ("%s: %s", pat_shelton, s);
|
|
else
|
|
regfree (®ex);
|
|
|
|
/* REG_STARTEND was added to glibc on 2004-01-15.
|
|
Reject older versions. */
|
|
if (REG_STARTEND == 0)
|
|
report_error ("REG_STARTEND is zero");
|
|
|
|
/* Matching with the compiled form of this regexp would provoke
|
|
an assertion failure prior to glibc-2.28:
|
|
regexec.c:1375: pop_fail_stack: Assertion 'num >= 0' failed
|
|
With glibc-2.28, compilation fails and reports the invalid
|
|
back reference. */
|
|
re_set_syntax (RE_SYNTAX_POSIX_EGREP);
|
|
memset (®ex, 0, sizeof regex);
|
|
static char const pat_badback[] = "0|()0|\\1|0";
|
|
s = re_compile_pattern (pat_badback, sizeof pat_badback, ®ex);
|
|
if (!s)
|
|
{
|
|
memset (®s, 0, sizeof regs);
|
|
if (re_search (®ex, "x", 1, 0, 1, ®s) != -1)
|
|
s = "mishandled invalid back reference";
|
|
regfree (®ex);
|
|
free (regs.start);
|
|
free (regs.end);
|
|
}
|
|
if (s && !streq (s, "Invalid back reference"))
|
|
report_error ("%s: %s", pat_badback, s);
|
|
|
|
/* bug#68725, reported by Ed Morton.
|
|
The regex uses backrefs with optional groups to detect palindromes. */
|
|
{
|
|
regex_t re68725;
|
|
int ret = regcomp (&re68725, "^(.?)(.?).?\\2\\1$", REG_EXTENDED);
|
|
if (ret)
|
|
report_error ("regcomp bug#68725 failed (%d)", ret);
|
|
else
|
|
{
|
|
regmatch_t pm;
|
|
/* "ab" is not a palindrome, so must not match with $. */
|
|
if (regexec (&re68725, "ab", 1, &pm, 0) == 0)
|
|
report_error ("regexec bug#68725: \"ab\" matched with $,"
|
|
" should not");
|
|
regfree (&re68725);
|
|
}
|
|
|
|
/* Without $, "ab" should match: the engine must retry with a
|
|
shorter match_last when set_regs fails at the longest
|
|
structural match. */
|
|
ret = regcomp (&re68725, "^(.?)(.?).?\\2\\1", REG_EXTENDED);
|
|
if (ret)
|
|
report_error ("regcomp bug#68725 (no $) failed (%d)", ret);
|
|
else
|
|
{
|
|
regmatch_t pm[3];
|
|
if (regexec (&re68725, "ab", 3, pm, 0) != 0)
|
|
report_error ("regexec bug#68725: \"ab\" should match"
|
|
" without $");
|
|
regfree (&re68725);
|
|
}
|
|
}
|
|
|
|
/* An assertion failure related to back references, seen in sed's dc.sed.
|
|
To reproduce, use gcc or clang with UBSAN. */
|
|
{
|
|
const char *addr = "^<\\([^~]*\\)\\([^~]\\)[^~]*~\\1\\(.\\).*|=.*\\3.*\\2";
|
|
const char *input =
|
|
"<,1583~,2002~2002~|P|K0|I10|O10|rpddsf[lfp[too early\n"
|
|
"]Pq]s@1583>@\n"
|
|
"ddd19%1+sg100/1+d3*4/12-sx8*5+25/5-sz5*4/lx-10-sdlg11*20+lz+lx-30%\n"
|
|
"d[30+]s@0>@d[[1+]s@lg11<@]s@25=@d[1+]s@24=@se44le-d[30+]s@21>@dld+7%-7+\n"
|
|
"[March ]smd[31-[April ]sm]s@31<@psnlmPpsn1z>p~|rf2002~|r@lfp[too early\n"
|
|
"]Pq~|?>@\n"
|
|
"ddd19%1+sg100/1+d3*4/12-sx8*5+25/5-sz5*4/lx-10-sdlg11*20+lz+lx-30%\n"
|
|
"d[30+]s@0>@d[[1+]s@lg11<@]s@25=@d[1+]s@24=@se44le-d[30+]s@21>@dld+7%-7+\n"
|
|
"[March ]smd[31-[April ]sm]s@31<@psnlmPpsn1z>p~|=-~.0,123456789<><";
|
|
re_set_syntax (RE_NO_SUB | RE_NO_POSIX_BACKTRACKING | RE_NO_EMPTY_RANGES
|
|
| RE_INTERVALS | RE_DOT_NEWLINE | RE_CHAR_CLASSES
|
|
| RE_BK_PLUS_QM);
|
|
regex_t r;
|
|
memset (&r, 0, sizeof r);
|
|
const char *errmsg = re_compile_pattern (addr, strlen (addr), &r);
|
|
if (errmsg)
|
|
report_error ("dc.sed preparation failure: %s", errmsg);
|
|
else
|
|
{
|
|
r.translate = NULL;
|
|
regoff_t ret = re_search (&r, input, strlen (input),
|
|
0, strlen (input), NULL);
|
|
(void) ret;
|
|
}
|
|
}
|
|
|
|
#if 0
|
|
/* It would be nice to reject hosts whose regoff_t values are too
|
|
narrow (including glibc on hosts with 64-bit ptrdiff_t and
|
|
32-bit int), but we should wait until glibc implements this
|
|
feature. Otherwise, support for equivalence classes and
|
|
multibyte collation symbols would always be broken except
|
|
when compiling --without-included-regex. */
|
|
if (sizeof (regoff_t) < sizeof (ptrdiff_t)
|
|
|| sizeof (regoff_t) < sizeof (ssize_t))
|
|
report_error ("regoff_t values are too narrow");
|
|
#endif
|
|
|
|
return exit_status;
|
|
}
|