mirror of
				https://sourceware.org/git/glibc.git
				synced 2025-10-30 10:45:40 +03:00 
			
		
		
		
	
		
			
				
	
	
		
			177 lines
		
	
	
		
			4.1 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			177 lines
		
	
	
		
			4.1 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
| /* Measure strcasecmp functions.
 | |
|    Copyright (C) 2013-2017 Free Software Foundation, Inc.
 | |
|    This file is part of the GNU C Library.
 | |
| 
 | |
|    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 <ctype.h>
 | |
| #define TEST_MAIN
 | |
| #define TEST_NAME "strcasecmp"
 | |
| #include "bench-string.h"
 | |
| 
 | |
| typedef int (*proto_t) (const char *, const char *);
 | |
| static int simple_strcasecmp (const char *, const char *);
 | |
| static int stupid_strcasecmp (const char *, const char *);
 | |
| 
 | |
| IMPL (stupid_strcasecmp, 0)
 | |
| IMPL (simple_strcasecmp, 0)
 | |
| IMPL (strcasecmp, 1)
 | |
| 
 | |
| static int
 | |
| simple_strcasecmp (const char *s1, const char *s2)
 | |
| {
 | |
|   int ret;
 | |
| 
 | |
|   while ((ret = ((unsigned char) tolower (*s1)
 | |
| 		 - (unsigned char) tolower (*s2))) == 0
 | |
| 	 && *s1++)
 | |
|     ++s2;
 | |
|   return ret;
 | |
| }
 | |
| 
 | |
| static int
 | |
| stupid_strcasecmp (const char *s1, const char *s2)
 | |
| {
 | |
|   size_t ns1 = strlen (s1) + 1, ns2 = strlen (s2) + 1;
 | |
|   size_t n = ns1 < ns2 ? ns1 : ns2;
 | |
|   int ret = 0;
 | |
| 
 | |
|   while (n--)
 | |
|     {
 | |
|       if ((ret = ((unsigned char) tolower (*s1)
 | |
| 		  - (unsigned char) tolower (*s2))) != 0)
 | |
| 	break;
 | |
|       ++s1;
 | |
|       ++s2;
 | |
|     }
 | |
|   return ret;
 | |
| }
 | |
| 
 | |
| static void
 | |
| do_one_test (impl_t *impl, const char *s1, const char *s2, int exp_result)
 | |
| {
 | |
|   size_t i, iters = INNER_LOOP_ITERS;
 | |
|   timing_t start, stop, cur;
 | |
|   int result = CALL (impl, s1, s2);
 | |
|   if ((exp_result == 0 && result != 0)
 | |
|       || (exp_result < 0 && result >= 0)
 | |
|       || (exp_result > 0 && result <= 0))
 | |
|     {
 | |
|       error (0, 0, "Wrong result in function %s %d %d", impl->name,
 | |
| 	     result, exp_result);
 | |
|       ret = 1;
 | |
|       return;
 | |
|     }
 | |
| 
 | |
|   TIMING_NOW (start);
 | |
|   for (i = 0; i < iters; ++i)
 | |
|     {
 | |
|       CALL (impl, s1, s2);
 | |
|     }
 | |
|   TIMING_NOW (stop);
 | |
| 
 | |
|   TIMING_DIFF (cur, start, stop);
 | |
| 
 | |
|   TIMING_PRINT_MEAN ((double) cur, (double) iters);
 | |
| }
 | |
| 
 | |
| static void
 | |
| do_test (size_t align1, size_t align2, size_t len, int max_char,
 | |
| 	 int exp_result)
 | |
| {
 | |
|   size_t i;
 | |
|   char *s1, *s2;
 | |
| 
 | |
|   if (len == 0)
 | |
|     return;
 | |
| 
 | |
|   align1 &= 7;
 | |
|   if (align1 + len + 1 >= page_size)
 | |
|     return;
 | |
| 
 | |
|   align2 &= 7;
 | |
|   if (align2 + len + 1 >= page_size)
 | |
|     return;
 | |
| 
 | |
|   s1 = (char *) (buf1 + align1);
 | |
|   s2 = (char *) (buf2 + align2);
 | |
| 
 | |
|   for (i = 0; i < len; i++)
 | |
|     {
 | |
|       s1[i] = toupper (1 + 23 * i % max_char);
 | |
|       s2[i] = tolower (s1[i]);
 | |
|     }
 | |
| 
 | |
|   s1[len] = s2[len] = 0;
 | |
|   s1[len + 1] = 23;
 | |
|   s2[len + 1] = 24 + exp_result;
 | |
|   if ((s2[len - 1] == 'z' && exp_result == -1)
 | |
|       || (s2[len - 1] == 'a' && exp_result == 1))
 | |
|     s1[len - 1] += exp_result;
 | |
|   else
 | |
|     s2[len - 1] -= exp_result;
 | |
| 
 | |
|   printf ("Length %4zd, alignment %2zd/%2zd:", len, align1, align2);
 | |
| 
 | |
|   FOR_EACH_IMPL (impl, 0)
 | |
|     do_one_test (impl, s1, s2, exp_result);
 | |
| 
 | |
|   putchar ('\n');
 | |
| }
 | |
| 
 | |
| int
 | |
| test_main (void)
 | |
| {
 | |
|   size_t i;
 | |
| 
 | |
|   test_init ();
 | |
| 
 | |
|   printf ("%23s", "");
 | |
|   FOR_EACH_IMPL (impl, 0)
 | |
|     printf ("\t%s", impl->name);
 | |
|   putchar ('\n');
 | |
| 
 | |
|   for (i = 1; i < 16; ++i)
 | |
|     {
 | |
|       do_test (i, i, i, 127, 0);
 | |
|       do_test (i, i, i, 127, 1);
 | |
|       do_test (i, i, i, 127, -1);
 | |
|     }
 | |
| 
 | |
|   for (i = 1; i < 10; ++i)
 | |
|     {
 | |
|       do_test (0, 0, 2 << i, 127, 0);
 | |
|       do_test (0, 0, 2 << i, 254, 0);
 | |
|       do_test (0, 0, 2 << i, 127, 1);
 | |
|       do_test (0, 0, 2 << i, 254, 1);
 | |
|       do_test (0, 0, 2 << i, 127, -1);
 | |
|       do_test (0, 0, 2 << i, 254, -1);
 | |
|     }
 | |
| 
 | |
|   for (i = 1; i < 8; ++i)
 | |
|     {
 | |
|       do_test (i, 2 * i, 8 << i, 127, 0);
 | |
|       do_test (2 * i, i, 8 << i, 254, 0);
 | |
|       do_test (i, 2 * i, 8 << i, 127, 1);
 | |
|       do_test (2 * i, i, 8 << i, 254, 1);
 | |
|       do_test (i, 2 * i, 8 << i, 127, -1);
 | |
|       do_test (2 * i, i, 8 << i, 254, -1);
 | |
|     }
 | |
| 
 | |
|   return ret;
 | |
| }
 | |
| 
 | |
| #include <support/test-driver.c>
 |