mirror of
				https://sourceware.org/git/glibc.git
				synced 2025-10-31 22:10:34 +03:00 
			
		
		
		
	
		
			
				
	
	
		
			92 lines
		
	
	
		
			2.3 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			92 lines
		
	
	
		
			2.3 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
| /* Test for regs allocation in re_search and re_match.
 | |
|    Copyright (C) 2002-2017 Free Software Foundation, Inc.
 | |
|    This file is part of the GNU C Library.
 | |
|    Contributed by Stepan Kasal <kasal@math.cas.cz>, 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, see
 | |
|    <http://www.gnu.org/licenses/>.  */
 | |
| 
 | |
| #include <locale.h>
 | |
| #include <stdio.h>
 | |
| #include <stdlib.h>
 | |
| #include <string.h>
 | |
| #include <sys/types.h>
 | |
| #include <regex.h>
 | |
| 
 | |
| 
 | |
| int
 | |
| main (void)
 | |
| {
 | |
|   struct re_pattern_buffer regex;
 | |
|   struct re_registers regs;
 | |
|   const char *s;
 | |
|   int match, n;
 | |
|   int result = 0;
 | |
| 
 | |
|   memset (®ex, '\0', sizeof (regex));
 | |
|   regs.start = regs.end = NULL;
 | |
|   regs.num_regs = 0;
 | |
|   s = re_compile_pattern ("a", 1, ®ex);
 | |
|   if (s != NULL)
 | |
|     {
 | |
|       puts ("failed to compile pattern \"a\"");
 | |
|       result = 1;
 | |
|     }
 | |
|   else
 | |
|     {
 | |
|       match = re_search (®ex, "baobab", 6, 0, 6, ®s);
 | |
|       n = 1;
 | |
|       if (match != 1)
 | |
| 	{
 | |
| 	  printf ("re_search returned %d, expected 1\n", match);
 | |
| 	  result = 1;
 | |
| 	}
 | |
|       else if (regs.num_regs <= n || regs.start[n] != -1 || regs.end[n] != -1)
 | |
| 	{
 | |
| 	  puts ("re_search failed to fill the -1 sentinel");
 | |
| 	  result = 1;
 | |
| 	}
 | |
|     }
 | |
| 
 | |
|   free (regex.buffer);
 | |
|   memset (®ex, '\0', sizeof (regex));
 | |
| 
 | |
|   s = re_compile_pattern ("\\(\\(\\(a\\)\\)\\)", 13, ®ex);
 | |
|   if (s != NULL)
 | |
|     {
 | |
|       puts ("failed to compile pattern /\\(\\(\\(a\\)\\)\\)/");
 | |
|       result = 1;
 | |
|     }
 | |
|   else
 | |
|     {
 | |
|       match = re_match (®ex, "apl", 3, 0, ®s);
 | |
|       n = 4;
 | |
|       if (match != 1)
 | |
| 	{
 | |
| 	  printf ("re_match returned %d, expected 1\n", match);
 | |
| 	  result = 1;
 | |
| 	}
 | |
|       else if (regs.num_regs <= n || regs.start[n] != -1 || regs.end[n] != -1)
 | |
| 	{
 | |
| 	  puts ("re_match failed to fill the -1 sentinel");
 | |
| 	  result = 1;
 | |
| 	}
 | |
|     }
 | |
| 
 | |
|   if (result == 0)
 | |
|     puts (" -> OK");
 | |
| 
 | |
|   return result;
 | |
| }
 |