1  /* Test for regs allocation in re_search and re_match.
       2     Copyright (C) 2002-2023 Free Software Foundation, Inc.
       3     This file is part of the GNU C Library.
       4  
       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.
       9  
      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.
      14  
      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/>.  */
      18  
      19  #include <locale.h>
      20  #include <stdio.h>
      21  #include <stdlib.h>
      22  #include <string.h>
      23  #include <sys/types.h>
      24  #include <regex.h>
      25  
      26  
      27  int
      28  main (void)
      29  {
      30    struct re_pattern_buffer regex;
      31    struct re_registers regs;
      32    const char *s;
      33    int match, n;
      34    int result = 0;
      35  
      36    memset (&regex, '\0', sizeof (regex));
      37    regs.start = regs.end = NULL;
      38    regs.num_regs = 0;
      39    s = re_compile_pattern ("a", 1, &regex);
      40    if (s != NULL)
      41      {
      42        puts ("failed to compile pattern \"a\"");
      43        result = 1;
      44      }
      45    else
      46      {
      47        match = re_search (&regex, "baobab", 6, 0, 6, &regs);
      48        n = 1;
      49        if (match != 1)
      50  	{
      51  	  printf ("re_search returned %d, expected 1\n", match);
      52  	  result = 1;
      53  	}
      54        else if (regs.num_regs <= n || regs.start[n] != -1 || regs.end[n] != -1)
      55  	{
      56  	  puts ("re_search failed to fill the -1 sentinel");
      57  	  result = 1;
      58  	}
      59      }
      60  
      61    free (regex.buffer);
      62    memset (&regex, '\0', sizeof (regex));
      63  
      64    s = re_compile_pattern ("\\(\\(\\(a\\)\\)\\)", 13, &regex);
      65    if (s != NULL)
      66      {
      67        puts ("failed to compile pattern /\\(\\(\\(a\\)\\)\\)/");
      68        result = 1;
      69      }
      70    else
      71      {
      72        match = re_match (&regex, "apl", 3, 0, &regs);
      73        n = 4;
      74        if (match != 1)
      75  	{
      76  	  printf ("re_match returned %d, expected 1\n", match);
      77  	  result = 1;
      78  	}
      79        else if (regs.num_regs <= n || regs.start[n] != -1 || regs.end[n] != -1)
      80  	{
      81  	  puts ("re_match failed to fill the -1 sentinel");
      82  	  result = 1;
      83  	}
      84      }
      85  
      86    if (result == 0)
      87      puts (" -> OK");
      88  
      89    return result;
      90  }