posix/bug-regex20.c

   1 /* Test for UTF-8 regular expression optimizations.
   2    Copyright (C) 2003 Free Software Foundation, Inc.
   3    This file is part of the GNU C Library.
   4    Contributed by Jakub Jelinek <jakub@redhat.com>, 2003.
   5
   6    The GNU C Library is free software; you can redistribute it and/or
   7    modify it under the terms of the GNU Lesser General Public
   8    License as published by the Free Software Foundation; either
   9    version 2.1 of the License, or (at your option) any later version.
  10
  11    The GNU C Library is distributed in the hope that it will be useful,
  12    but WITHOUT ANY WARRANTY; without even the implied warranty of
  13    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14    Lesser General Public License for more details.
  15
  16    You should have received a copy of the GNU Lesser General Public
  17    License along with the GNU C Library; if not, write to the Free
  18    Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  19    02111-1307 USA.  */
  20
  21 #include <sys/types.h>
  22 #include <mcheck.h>
  23 #include <regex.h>
  24 #include <stdio.h>
  25 #include <stdlib.h>
  26 #include <string.h>
  27 #include <locale.h>
  28
  29 #define RE_NO_INTERNAL_PROTOTYPES 1
  30 #include "regex_internal.h"
  31
  32 #define BRE RE_SYNTAX_POSIX_BASIC
  33 #define ERE RE_SYNTAX_POSIX_EXTENDED
  34
  35 static struct
  36 {
  37   int syntax;
  38   const char *pattern;
  39   const char *string;
  40   int res, optimize;
  41 } tests[] = {
  42   /* \xc3\x84           LATIN CAPITAL LETTER A WITH DIAERESIS
  43      \xc3\x96           LATIN CAPITAL LETTER O WITH DIAERESIS
  44      \xc3\xa4           LATIN SMALL LETTER A WITH DIAERESIS
  45      \xc3\xb6           LATIN SMALL LETTER O WITH DIAERESIS
  46      \xe2\x80\x94       EM DASH  */
  47   /* Should be optimized.  */
  48   {BRE, "foo", "b\xc3\xa4rfoob\xc3\xa4z", 4, 1},
  49   {BRE, "b\xc3\xa4z", "b\xc3\xa4rfoob\xc3\xa4z", 7, 1},
  50   {BRE, "b\xc3\xa4*z", "b\xc3\xa4rfoob\xc3\xa4z", 7, 1},
  51   {BRE, "b\xc3\xa4*z", "b\xc3\xa4rfoobz", 7, 1},
  52   {BRE, "b\xc3\xa4\\+z", "b\xc3\xa4rfoob\xc3\xa4\xc3\xa4z", 7, 1},
  53   {BRE, "b\xc3\xa4\\?z", "b\xc3\xa4rfoob\xc3\xa4z", 7, 1},
  54   {BRE, "b\xc3\xa4\\{1,2\\}z", "b\xc3\xa4rfoob\xc3\xa4z", 7, 1},
  55   {BRE, "^x\\|xy*z$", "\xc3\xb6xyyz", 2, 1},
  56   {BRE, "^x\\\\y\\{6\\}z\\+", "x\\yyyyyyzz\xc3\xb6", 0, 1},
  57   {BRE, "^x\\\\y\\{2,36\\}z\\+", "x\\yzz\xc3\xb6", -1, 1},
  58   {BRE, "^x\\\\y\\{,3\\}z\\+", "x\\yyyzz\xc3\xb6", 0, 1},
  59   {BRE, "^x\\|x\xc3\xa4*z$", "\xc3\xb6x\xc3\xa4\xc3\xa4z", 2, 1},
  60   {BRE, "^x\\\\\xc3\x84\\{6\\}z\\+",
  61    "x\\\xc3\x84\xc3\x84\xc3\x84\xc3\x84\xc3\x84\xc3\x84zz\xc3\xb6", 0, 1},
  62   {BRE, "^x\\\\\xc3\x84\\{2,36\\}z\\+", "x\\\xc3\x84zz\xc3\xb6", -1, 1},
  63   {BRE, "^x\\\\\xc3\x84\\{,3\\}z\\+",
  64    "x\\\xc3\x84\xc3\x84\xc3\x84zz\xc3\xb6", 0, 1},
  65   {BRE, "x[C]y", "axCy", 1, 1},
  66   {BRE, "x[ABC]y", "axCy", 1, 1},
  67   {BRE, "\\`x\\|z\\'", "x\xe2\x80\x94", 0, 1},
  68   {BRE, "\\(xy\\)z\\1a\\1", "\xe2\x80\x94xyzxyaxy\xc3\x84", 3, 1},
  69   {BRE, "xy\\?z", "\xc3\x84xz\xc3\xb6", 2, 1},
  70   {BRE, "\\`\xc3\x84\\|z\\'", "\xc3\x84\xe2\x80\x94", 0, 1},
  71   {BRE, "\\(x\xc3\x84\\)z\\1\x61\\1",
  72    "\xe2\x80\x94x\xc3\x84zx\xc3\x84\x61x\xc3\x84\xc3\x96", 3, 1},
  73   {BRE, "x\xc3\x96\\?z", "\xc3\x84xz\xc3\xb6", 2, 1},
  74   {BRE, "x.y", "ax\xe2\x80\x94yz", 1, 1},
  75   {BRE, "x.*z", "\xc3\x84xz", 2, 1},
  76   {BRE, "x.*z", "\xc3\x84x\xe2\x80\x94z", 2, 1},
  77   {BRE, "x.*z", "\xc3\x84x\xe2\x80\x94y\xf1\x90\x80\x90z", 2, 1},
  78   {BRE, "x.*z", "\xc3\x84x\xe2\x80\x94\xc3\x94\xf1\x90\x80\x90z", 2, 1},
  79   {BRE, "x.\\?z", "axz", 1, 1},
  80   {BRE, "x.\\?z", "axyz", 1, 1},
  81   {BRE, "x.\\?z", "ax\xc3\x84z", 1, 1},
  82   {BRE, "x.\\?z", "ax\xe2\x80\x94z", 1, 1},
  83   {BRE, "x.\\?z", "ax\xf0\x9d\x80\x80z", 1, 1},
  84   {BRE, "x.\\?z", "ax\xf9\x81\x82\x83\x84z", 1, 1},
  85   {BRE, "x.\\?z", "ax\xfd\xbf\xbf\xbf\xbf\xbfz", 1, 1},
  86   {BRE, ".", "y", 0, 1},
  87   {BRE, ".", "\xc3\x84", 0, 1},
  88   {BRE, ".", "\xe2\x80\x94", 0, 1},
  89   {BRE, ".", "\xf0\x9d\x80\x80", 0, 1},
  90   {BRE, ".", "\xf9\x81\x82\x83\x84", 0, 1},
  91   {BRE, ".", "\xfd\xbf\xbf\xbf\xbf\xbf", 0, 1},
  92   {BRE, "x.\\?z", "axyyz", -1, 1},
  93   {BRE, "x.\\?z", "ax\xc3\x84\xc3\x96z", -1, 1},
  94   {BRE, "x.\\?z", "ax\xe2\x80\x94\xc3\xa4z", -1, 1},
  95   {BRE, "x.\\?z", "ax\xf0\x9d\x80\x80yz", -1, 1},
  96   {BRE, "x.\\?z", "ax\xf9\x81\x82\x83\x84\xf0\x9d\x80\x81z", -1, 1},
  97   {BRE, "x.\\?z", "ax\xfd\xbf\xbf\xbf\xbf\xbf\xc3\x96z", -1, 1},
  98   {BRE, "x.\\+z", "\xe2\x80\x94xz", -1, 1},
  99   {BRE, "x.\\+z", "\xe2\x80\x94xyz", 3, 1},
 100   {BRE, "x.\\+z", "\xe2\x80\x94x\xc3\x84y\xe2\x80\x94z", 3, 1},
 101   {BRE, "x.\\+z", "\xe2\x80\x94x\xe2\x80\x94z", 3, 1},
 102   {BRE, "x.\\+z", "\xe2\x80\x94x\xf0\x9d\x80\x80\xc3\x84z", 3, 1},
 103   {BRE, "x.\\+z", "\xe2\x80\x94x.~\xe2\x80\x94\xf9\x81\x82\x83\x84z", 3, 1},
 104   {BRE, "x.\\+z", "\xe2\x80\x94x\xfd\xbf\xbf\xbf\xbf\xbfz", 3, 1},
 105   {BRE, "x.\\{1,2\\}z", "\xe2\x80\x94xz", -1, 1},
 106   {BRE, "x.\\{1,2\\}z", "\xe2\x80\x94x\xc3\x96y\xc3\xa4z", -1, 1},
 107   {BRE, "x.\\{1,2\\}z", "\xe2\x80\x94xyz", 3, 1},
 108   {BRE, "x.\\{1,2\\}z", "\xe2\x80\x94x\xc3\x84\xe2\x80\x94z", 3, 1},
 109   {BRE, "x.\\{1,2\\}z", "\xe2\x80\x94x\xe2\x80\x94z", 3, 1},
 110   {BRE, "x.\\{1,2\\}z", "\xe2\x80\x94x\xf0\x9d\x80\x80\xc3\x84z", 3, 1},
 111   {BRE, "x.\\{1,2\\}z", "\xe2\x80\x94x~\xe2\x80\x94z", 3, 1},
 112   {BRE, "x.\\{1,2\\}z", "\xe2\x80\x94x\xfd\xbf\xbf\xbf\xbf\xbfz", 3, 1},
 113   {BRE, "x\\(.w\\|\xc3\x86\\)\\?z", "axz", 1, 1},
 114   {BRE, "x\\(.w\\|\xc3\x86\\)\\?z", "ax\xfd\xbf\xbf\xbf\xbf\xbfwz", 1, 1},
 115   {BRE, "x\\(.w\\|\xc3\x86\\)\\?z", "ax\xc3\x86z", 1, 1},
 116   {BRE, "x\\(.w\\|\xc3\x86\\)\\?z", "ax\xe2\x80\x96wz", 1, 1},
 117   {ERE, "foo", "b\xc3\xa4rfoob\xc3\xa4z", 4, 1},
 118   {ERE, "^x|xy*z$", "\xc3\xb6xyyz", 2, 1},
 119   {ERE, "^x\\\\y{6}z+", "x\\yyyyyyzz\xc3\xb6", 0, 1},
 120   {ERE, "^x\\\\y{2,36}z+", "x\\yzz\xc3\xb6", -1, 1},
 121   {ERE, "^x\\\\y{,3}z+", "x\\yyyzz\xc3\xb6", 0, 1},
 122   {ERE, "x[C]y", "axCy", 1, 1},
 123   {ERE, "x[ABC]y", "axCy", 1, 1},
 124   {ERE, "\\`x|z\\'", "x\xe2\x80\x94", 0, 1},
 125   {ERE, "(xy)z\\1a\\1", "\xe2\x80\x94xyzxyaxy\xc3\x84", 3, 1},
 126   {ERE, "xy?z", "\xc3\x84xz\xc3\xb6", 2, 1},
 127   {ERE, "x.y", "ax\xe2\x80\x94yz", 1, 1},
 128   {ERE, "x.*z", "\xc3\x84xz", 2, 1},
 129   {ERE, "x.*z", "\xc3\x84x\xe2\x80\x94z", 2, 1},
 130   {ERE, "x.*z", "\xc3\x84x\xe2\x80\x94y\xf1\x90\x80\x90z", 2, 1},
 131   {ERE, "x.*z", "\xc3\x84x\xe2\x80\x94\xc3\x94\xf1\x90\x80\x90z", 2, 1},
 132   {ERE, "x.?z", "axz", 1, 1},
 133   {ERE, "x.?z", "axyz", 1, 1},
 134   {ERE, "x.?z", "ax\xc3\x84z", 1, 1},
 135   {ERE, "x.?z", "ax\xe2\x80\x94z", 1, 1},
 136   {ERE, "x.?z", "ax\xf0\x9d\x80\x80z", 1, 1},
 137   {ERE, "x.?z", "ax\xf9\x81\x82\x83\x84z", 1, 1},
 138   {ERE, "x.?z", "ax\xfd\xbf\xbf\xbf\xbf\xbfz", 1, 1},
 139   {ERE, "x.?z", "axyyz", -1, 1},
 140   {ERE, "x.?z", "ax\xc3\x84\xc3\x96z", -1, 1},
 141   {ERE, "x.?z", "ax\xe2\x80\x94\xc3\xa4z", -1, 1},
 142   {ERE, "x.?z", "ax\xf0\x9d\x80\x80yz", -1, 1},
 143   {ERE, "x.?z", "ax\xf9\x81\x82\x83\x84\xf0\x9d\x80\x81z", -1, 1},
 144   {ERE, "x.?z", "ax\xfd\xbf\xbf\xbf\xbf\xbf\xc3\x96z", -1, 1},
 145   {ERE, "x.+z", "\xe2\x80\x94xz", -1, 1},
 146   {ERE, "x.+z", "\xe2\x80\x94xyz", 3, 1},
 147   {ERE, "x.+z", "\xe2\x80\x94x\xc3\x84y\xe2\x80\x94z", 3, 1},
 148   {ERE, "x.+z", "\xe2\x80\x94x\xe2\x80\x94z", 3, 1},
 149   {ERE, "x.+z", "\xe2\x80\x94x\xf0\x9d\x80\x80\xc3\x84z", 3, 1},
 150   {ERE, "x.+z", "\xe2\x80\x94x.~\xe2\x80\x94\xf9\x81\x82\x83\x84z", 3, 1},
 151   {ERE, "x.+z", "\xe2\x80\x94x\xfd\xbf\xbf\xbf\xbf\xbfz", 3, 1},
 152   {ERE, "x.{1,2}z", "\xe2\x80\x94xz", -1, 1},
 153   {ERE, "x.{1,2}z", "\xe2\x80\x94x\xc3\x96y\xc3\xa4z", -1, 1},
 154   {ERE, "x.{1,2}z", "\xe2\x80\x94xyz", 3, 1},
 155   {ERE, "x.{1,2}z", "\xe2\x80\x94x\xc3\x84\xe2\x80\x94z", 3, 1},
 156   {ERE, "x.{1,2}z", "\xe2\x80\x94x\xe2\x80\x94z", 3, 1},
 157   {ERE, "x.{1,2}z", "\xe2\x80\x94x\xf0\x9d\x80\x80\xc3\x84z", 3, 1},
 158   {ERE, "x.{1,2}z", "\xe2\x80\x94x~\xe2\x80\x94z", 3, 1},
 159   {ERE, "x.{1,2}z", "\xe2\x80\x94x\xfd\xbf\xbf\xbf\xbf\xbfz", 3, 1},
 160   {ERE, "x(.w|\xc3\x86)?z", "axz", 1, 1},
 161   {ERE, "x(.w|\xc3\x86)?z", "ax\xfd\xbf\xbf\xbf\xbf\xbfwz", 1, 1},
 162   {ERE, "x(.w|\xc3\x86)?z", "ax\xc3\x86z", 1, 1},
 163   {ERE, "x(.w|\xc3\x86)?z", "ax\xe2\x80\x96wz", 1, 1},
 164   /* Should not be optimized.  */
 165   {BRE, "x[\xc3\x84\xc3\xa4]y", "ax\xc3\xa4y", 1, 0},
 166   {BRE, "x[A-Z,]y", "axCy", 1, 0},
 167   {BRE, "x[^y]z", "ax\xe2\x80\x94z", 1, 0},
 168   {BRE, "x[[:alnum:]]z", "ax\xc3\x96z", 1, 0},
 169   {BRE, "x[[=A=]]z", "axAz", 1, 0},
 170   {BRE, "x[[=\xc3\x84=]]z", "ax\xc3\x84z", 1, 0},
 171   {BRE, "\\<g", "\xe2\x80\x94g", 3, 0},
 172   {BRE, "\\bg\\b", "\xe2\x80\x94g", 3, 0},
 173   {BRE, "\\Bg\\B", "\xc3\xa4g\xc3\xa4", 2, 0},
 174   {BRE, "a\\wz", "a\xc3\x84z", 0, 0},
 175   {BRE, "x\\Wz", "\xc3\x96x\xe2\x80\x94z", 2, 0},
 176   {ERE, "x[\xc3\x84\xc3\xa4]y", "ax\xc3\xa4y", 1, 0},
 177   {ERE, "x[A-Z,]y", "axCy", 1, 0},
 178   {ERE, "x[^y]z", "ax\xe2\x80\x94z", 1, 0},
 179   {ERE, "x[[:alnum:]]z", "ax\xc3\x96z", 1, 0},
 180   {ERE, "x[[=A=]]z", "axAz", 1, 0},
 181   {ERE, "x[[=\xc3\x84=]]z", "ax\xc3\x84z", 1, 0},
 182   {ERE, "\\<g", "\xe2\x80\x94g", 3, 0},
 183   {ERE, "\\bg\\b", "\xe2\x80\x94g", 3, 0},
 184   {ERE, "\\Bg\\B", "\xc3\xa4g\xc3\xa4", 2, 0},
 185   {ERE, "a\\wz", "a\xc3\x84z", 0, 0},
 186   {ERE, "x\\Wz", "\xc3\x96x\xe2\x80\x94z", 2, 0},
 187 };
 188
 189 int
 190 main (void)
 191 {
 192   struct re_pattern_buffer regbuf;
 193   const char *err;
 194   size_t i;
 195   int ret = 0;
 196
 197   mtrace ();
 198
 199   setlocale (LC_ALL, "de_DE.UTF-8");
 200   for (i = 0; i < sizeof (tests) / sizeof (tests[0]); ++i)
 201     {
 202       int res, optimized;
 203
 204       re_set_syntax (tests[i].syntax);
 205       memset (&regbuf, '\0', sizeof (regbuf));
 206       err = re_compile_pattern (tests[i].pattern, strlen (tests[i].pattern),
 207                                 &regbuf);
 208       if (err != NULL)
 209         {
 210           printf ("re_compile_pattern failed: %s\n", err);
 211           ret = 1;
 212           continue;
 213         }
 214
 215       /* Check if re_search will be done as multi-byte or single-byte.  */
 216       optimized = ((re_dfa_t *) regbuf.buffer)->mb_cur_max == 1;
 217       if (optimized != tests[i].optimize)
 218         {
 219           printf ("pattern %zd %soptimized while it should%s be\n",
 220                   i, optimized ? "" : "not ", tests[i].optimize ? "" : " not");
 221           ret = 1;
 222         }
 223
 224       int str_len = strlen (tests[i].string);
 225       res = re_search (&regbuf, tests[i].string, str_len, 0, str_len, NULL);
 226       if (res != tests[i].res)
 227         {
 228           printf ("re_search %zd failed: %d\n", i, res);
 229           ret = 1;
 230           regfree (&regbuf);
 231           continue;
 232         }
 233
 234       res = re_search (&regbuf, tests[i].string, str_len, str_len, -str_len,
 235                        NULL);
 236       if (res != tests[i].res)
 237         {
 238           printf ("backward re_search %zd failed: %d\n", i, res);
 239           ret = 1;
 240           regfree (&regbuf);
 241           continue;
 242         }
 243       regfree (&regbuf);
 244
 245       re_set_syntax (tests[i].syntax | RE_ICASE);
 246       memset (&regbuf, '\0', sizeof (regbuf));
 247       err = re_compile_pattern (tests[i].pattern, strlen (tests[i].pattern),
 248                                 &regbuf);
 249       if (err != NULL)
 250         {
 251           printf ("re_compile_pattern failed: %s\n", err);
 252           ret = 1;
 253           continue;
 254         }
 255
 256       /* Check if re_search will be done as multi-byte or single-byte.  */
 257       optimized = ((re_dfa_t *) regbuf.buffer)->mb_cur_max == 1;
 258       if (optimized)
 259         {
 260           printf ("pattern %zd optimized while it should not be when case insensitive\n",
 261                   i);
 262           ret = 1;
 263         }
 264
 265       res = re_search (&regbuf, tests[i].string, str_len, 0, str_len, NULL);
 266       if (res != tests[i].res)
 267         {
 268           printf ("ICASE re_search %zd failed: %d\n", i, res);
 269           ret = 1;
 270           regfree (&regbuf);
 271           continue;
 272         }
 273
 274       res = re_search (&regbuf, tests[i].string, str_len, str_len, -str_len,
 275                        NULL);
 276       if (res != tests[i].res)
 277         {
 278           printf ("ICASE backward re_search %zd failed: %d\n", i, res);
 279           ret = 1;
 280           regfree (&regbuf);
 281           continue;
 282         }
 283       regfree (&regbuf);
 284     }
 285
 286   return ret;
 287 }