mirror of
https://sourceware.org/git/glibc.git
synced 2024-12-27 05:00:15 +00:00
688903eb3e
* All files with FSF copyright notices: Update copyright dates using scripts/update-copyrights. * locale/programs/charmap-kw.h: Regenerated. * locale/programs/locfile-kw.h: Likewise.
208 lines
5.0 KiB
C
208 lines
5.0 KiB
C
/* Measure strncasecmp functions.
|
|
Copyright (C) 2013-2018 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 "strncasecmp"
|
|
#include "bench-string.h"
|
|
|
|
typedef int (*proto_t) (const char *, const char *, size_t);
|
|
static int simple_strncasecmp (const char *, const char *, size_t);
|
|
static int stupid_strncasecmp (const char *, const char *, size_t);
|
|
|
|
IMPL (stupid_strncasecmp, 0)
|
|
IMPL (simple_strncasecmp, 0)
|
|
IMPL (strncasecmp, 1)
|
|
|
|
static int
|
|
simple_strncasecmp (const char *s1, const char *s2, size_t n)
|
|
{
|
|
int ret;
|
|
|
|
if (n == 0)
|
|
return 0;
|
|
|
|
while ((ret = ((unsigned char) tolower (*s1)
|
|
- (unsigned char) tolower (*s2))) == 0
|
|
&& *s1++)
|
|
{
|
|
if (--n == 0)
|
|
return 0;
|
|
++s2;
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
static int
|
|
stupid_strncasecmp (const char *s1, const char *s2, size_t max)
|
|
{
|
|
size_t ns1 = strlen (s1) + 1;
|
|
size_t ns2 = strlen (s2) + 1;
|
|
size_t n = ns1 < ns2 ? ns1 : ns2;
|
|
if (n > max)
|
|
n = max;
|
|
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, size_t n,
|
|
int exp_result)
|
|
{
|
|
size_t i, iters = INNER_LOOP_ITERS;
|
|
timing_t start, stop, cur;
|
|
|
|
TIMING_NOW (start);
|
|
for (i = 0; i < iters; ++i)
|
|
{
|
|
CALL (impl, s1, s2, n);
|
|
}
|
|
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 n, 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, n, 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 - 1, i, 127, 0);
|
|
|
|
do_test (i, i, i, i, 127, 0);
|
|
do_test (i, i, i, i, 127, 1);
|
|
do_test (i, i, i, i, 127, -1);
|
|
|
|
do_test (i, i, i + 1, i, 127, 0);
|
|
do_test (i, i, i + 1, i, 127, 1);
|
|
do_test (i, i, i + 1, i, 127, -1);
|
|
}
|
|
|
|
for (i = 1; i < 10; ++i)
|
|
{
|
|
do_test (0, 0, (2 << i) - 1, 2 << i, 127, 0);
|
|
do_test (0, 0, 2 << i, 2 << i, 254, 0);
|
|
do_test (0, 0, (2 << i) + 1, 2 << i, 127, 0);
|
|
|
|
do_test (0, 0, (2 << i) + 1, 2 << i, 254, 0);
|
|
|
|
do_test (0, 0, 2 << i, 2 << i, 127, 1);
|
|
do_test (0, 0, (2 << i) + 10, 2 << i, 127, 1);
|
|
|
|
do_test (0, 0, 2 << i, 2 << i, 254, 1);
|
|
do_test (0, 0, (2 << i) + 10, 2 << i, 254, 1);
|
|
|
|
do_test (0, 0, 2 << i, 2 << i, 127, -1);
|
|
do_test (0, 0, (2 << i) + 10, 2 << i, 127, -1);
|
|
|
|
do_test (0, 0, 2 << i, 2 << i, 254, -1);
|
|
do_test (0, 0, (2 << i) + 10, 2 << i, 254, -1);
|
|
}
|
|
|
|
for (i = 1; i < 8; ++i)
|
|
{
|
|
do_test (i, 2 * i, (8 << i) - 1, 8 << i, 127, 0);
|
|
do_test (i, 2 * i, 8 << i, 8 << i, 127, 0);
|
|
do_test (i, 2 * i, (8 << i) + 100, 8 << i, 127, 0);
|
|
|
|
do_test (2 * i, i, (8 << i) - 1, 8 << i, 254, 0);
|
|
do_test (2 * i, i, 8 << i, 8 << i, 254, 0);
|
|
do_test (2 * i, i, (8 << i) + 100, 8 << i, 254, 0);
|
|
|
|
do_test (i, 2 * i, 8 << i, 8 << i, 127, 1);
|
|
do_test (i, 2 * i, (8 << i) + 100, 8 << i, 127, 1);
|
|
|
|
do_test (2 * i, i, 8 << i, 8 << i, 254, 1);
|
|
do_test (2 * i, i, (8 << i) + 100, 8 << i, 254, 1);
|
|
|
|
do_test (i, 2 * i, 8 << i, 8 << i, 127, -1);
|
|
do_test (i, 2 * i, (8 << i) + 100, 8 << i, 127, -1);
|
|
|
|
do_test (2 * i, i, 8 << i, 8 << i, 254, -1);
|
|
do_test (2 * i, i, (8 << i) + 100, 8 << i, 254, -1);
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
|
|
#include <support/test-driver.c>
|