stdlib: Implement introsort for qsort (BZ 19305)
[glibc.git] / posix / bug-regex2.c
blobae8c2694fc6ed8b7789b06d286f6e0dba65ac2bd
1 /* Test for memory handling in regex.
2 Copyright (C) 2001-2023 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
5 The GNU C Library is free software; you can redistribute it and/or
6 modify it under the terms of the GNU Lesser General Public
7 License as published by the Free Software Foundation; either
8 version 2.1 of the License, or (at your option) any later version.
10 The GNU C Library is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public
16 License along with the GNU C Library; if not, see
17 <https://www.gnu.org/licenses/>. */
19 #include <sys/types.h>
20 #include <mcheck.h>
21 #include <regex.h>
22 #include <stdio.h>
23 #include <stdlib.h>
26 static const char text[] = "This is a test; this is a test";
28 int
29 main (void)
31 regex_t re;
32 regmatch_t rm[2];
33 int n;
35 mtrace ();
37 n = regcomp (&re, "a test", REG_EXTENDED);
38 if (n != 0)
40 char buf[500];
41 regerror (n, &re, buf, sizeof (buf));
42 printf ("regcomp failed: %s\n", buf);
43 exit (1);
46 for (n = 0; n < 20; ++n)
47 regexec (&re, text, 2, rm, 0);
49 regfree (&re);
51 return 0;