2013-06-04 19:18:56 +08:00
|
|
|
/* Measure strncat functions.
|
2016-01-05 00:05:18 +08:00
|
|
|
Copyright (C) 2013-2016 Free Software Foundation, Inc.
|
2013-06-04 19:18:56 +08:00
|
|
|
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/>. */
|
|
|
|
|
|
|
|
#define TEST_MAIN
|
2015-08-26 16:26:22 +08:00
|
|
|
#ifndef WIDE
|
|
|
|
# define TEST_NAME "strncat"
|
|
|
|
#else
|
|
|
|
# define TEST_NAME "wcsncat"
|
|
|
|
#endif /* WIDE */
|
2013-06-04 19:18:56 +08:00
|
|
|
#include "bench-string.h"
|
|
|
|
|
2015-08-26 16:26:22 +08:00
|
|
|
#ifndef WIDE
|
|
|
|
# define STRNCAT strncat
|
|
|
|
# define CHAR char
|
|
|
|
# define SIMPLE_STRNCAT simple_strncat
|
|
|
|
# define STUPID_STRNCAT stupid_strncat
|
|
|
|
# define STRLEN strlen
|
|
|
|
# define MEMCMP memcmp
|
|
|
|
# define BIG_CHAR CHAR_MAX
|
|
|
|
# define SMALL_CHAR 127
|
|
|
|
#else
|
|
|
|
# include <wchar.h>
|
|
|
|
# define STRNCAT wcsncat
|
|
|
|
# define CHAR wchar_t
|
|
|
|
# define SIMPLE_STRNCAT simple_wcsncat
|
|
|
|
# define STUPID_STRNCAT stupid_wcsncat
|
|
|
|
# define STRLEN wcslen
|
|
|
|
# define MEMCMP wmemcmp
|
|
|
|
# define BIG_CHAR WCHAR_MAX
|
|
|
|
# define SMALL_CHAR 1273
|
|
|
|
#endif /* WIDE */
|
|
|
|
|
|
|
|
typedef CHAR *(*proto_t) (CHAR *, const CHAR *, size_t);
|
|
|
|
CHAR *STUPID_STRNCAT (CHAR *, const CHAR *, size_t);
|
|
|
|
CHAR *SIMPLE_STRNCAT (CHAR *, const CHAR *, size_t);
|
|
|
|
|
|
|
|
IMPL (STUPID_STRNCAT, 0)
|
|
|
|
IMPL (STRNCAT, 2)
|
|
|
|
|
|
|
|
CHAR *
|
|
|
|
STUPID_STRNCAT (CHAR *dst, const CHAR *src, size_t n)
|
2013-06-04 19:18:56 +08:00
|
|
|
{
|
2015-08-26 16:26:22 +08:00
|
|
|
CHAR *ret = dst;
|
2013-06-04 19:18:56 +08:00
|
|
|
while (*dst++ != '\0');
|
|
|
|
--dst;
|
|
|
|
while (n--)
|
2015-08-26 16:26:22 +08:00
|
|
|
if ((*dst++ = *src++) == '\0')
|
2013-06-04 19:18:56 +08:00
|
|
|
return ret;
|
|
|
|
*dst = '\0';
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2015-08-26 16:26:22 +08:00
|
|
|
do_one_test (impl_t *impl, CHAR *dst, const CHAR *src, size_t n)
|
2013-06-04 19:18:56 +08:00
|
|
|
{
|
2015-08-26 16:26:22 +08:00
|
|
|
size_t k = STRLEN (dst), i, iters = INNER_LOOP_ITERS;
|
2013-09-02 21:13:50 +08:00
|
|
|
timing_t start, stop, cur;
|
|
|
|
|
2013-06-04 19:18:56 +08:00
|
|
|
if (CALL (impl, dst, src, n) != dst)
|
|
|
|
{
|
|
|
|
error (0, 0, "Wrong result in function %s %p != %p", impl->name,
|
|
|
|
CALL (impl, dst, src, n), dst);
|
|
|
|
ret = 1;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2015-08-26 16:26:22 +08:00
|
|
|
size_t len = STRLEN (src);
|
|
|
|
if (MEMCMP (dst + k, src, len + 1 > n ? n : len + 1) != 0)
|
2013-06-04 19:18:56 +08:00
|
|
|
{
|
2015-08-26 16:26:22 +08:00
|
|
|
error (0, 0, "Incorrect concatenation in function %s",
|
2013-06-04 19:18:56 +08:00
|
|
|
impl->name);
|
|
|
|
ret = 1;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (n < len && dst[k + n] != '\0')
|
|
|
|
{
|
|
|
|
error (0, 0, "There is no zero in the end of output string in %s",
|
|
|
|
impl->name);
|
|
|
|
ret = 1;
|
|
|
|
return;
|
|
|
|
}
|
2013-09-02 21:13:50 +08:00
|
|
|
|
|
|
|
TIMING_NOW (start);
|
|
|
|
for (i = 0; i < iters; ++i)
|
2013-06-04 19:18:56 +08:00
|
|
|
{
|
2013-09-02 21:13:50 +08:00
|
|
|
dst[k] = '\0';
|
|
|
|
CALL (impl, dst, src, n);
|
|
|
|
}
|
|
|
|
TIMING_NOW (stop);
|
2013-06-04 19:18:56 +08:00
|
|
|
|
2013-09-02 21:13:50 +08:00
|
|
|
TIMING_DIFF (cur, start, stop);
|
2013-06-04 19:18:56 +08:00
|
|
|
|
2013-09-02 21:13:50 +08:00
|
|
|
TIMING_PRINT_MEAN ((double) cur, (double) iters);
|
2013-06-04 19:18:56 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
do_test (size_t align1, size_t align2, size_t len1, size_t len2,
|
|
|
|
size_t n, int max_char)
|
|
|
|
{
|
|
|
|
size_t i;
|
2015-08-26 16:26:22 +08:00
|
|
|
CHAR *s1, *s2;
|
2013-06-04 19:18:56 +08:00
|
|
|
|
|
|
|
align1 &= 7;
|
2015-08-26 16:26:22 +08:00
|
|
|
if ((align1 + len1) * sizeof (CHAR) >= page_size)
|
2013-06-04 19:18:56 +08:00
|
|
|
return;
|
2015-08-26 16:26:22 +08:00
|
|
|
if ((align1 + n) * sizeof (CHAR) > page_size)
|
2013-06-04 19:18:56 +08:00
|
|
|
return;
|
|
|
|
align2 &= 7;
|
2015-08-26 16:26:22 +08:00
|
|
|
if ((align2 + len1 + len2) * sizeof (CHAR) >= page_size)
|
2013-06-04 19:18:56 +08:00
|
|
|
return;
|
2015-08-26 16:26:22 +08:00
|
|
|
if ((align2 + len1 + n) * sizeof (CHAR) > page_size)
|
2013-06-04 19:18:56 +08:00
|
|
|
return;
|
2015-08-26 16:26:22 +08:00
|
|
|
s1 = (CHAR *) (buf1) + align1;
|
|
|
|
s2 = (CHAR *) (buf2) + align2;
|
2013-06-04 19:18:56 +08:00
|
|
|
|
|
|
|
for (i = 0; i < len1; ++i)
|
|
|
|
s1[i] = 32 + 23 * i % (max_char - 32);
|
|
|
|
s1[len1] = '\0';
|
|
|
|
|
|
|
|
for (i = 0; i < len2; i++)
|
|
|
|
s2[i] = 32 + 23 * i % (max_char - 32);
|
|
|
|
|
2013-09-02 21:13:50 +08:00
|
|
|
printf ("Length %4zd/%4zd, alignment %2zd/%2zd, N %4zd:",
|
|
|
|
len1, len2, align1, align2, n);
|
2013-06-04 19:18:56 +08:00
|
|
|
|
|
|
|
FOR_EACH_IMPL (impl, 0)
|
|
|
|
{
|
|
|
|
s2[len2] = '\0';
|
|
|
|
do_one_test (impl, s2, s1, n);
|
|
|
|
}
|
|
|
|
|
2013-09-02 21:13:50 +08:00
|
|
|
putchar ('\n');
|
2013-06-04 19:18:56 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
main (void)
|
|
|
|
{
|
|
|
|
size_t i, n;
|
|
|
|
|
|
|
|
test_init ();
|
|
|
|
|
|
|
|
printf ("%28s", "");
|
|
|
|
FOR_EACH_IMPL (impl, 0)
|
|
|
|
printf ("\t%s", impl->name);
|
|
|
|
putchar ('\n');
|
|
|
|
|
|
|
|
for (n = 2; n <= 2048; n*=4)
|
|
|
|
{
|
2015-08-26 16:26:22 +08:00
|
|
|
do_test (0, 2, 2, 2, n, SMALL_CHAR);
|
|
|
|
do_test (0, 0, 4, 4, n, SMALL_CHAR);
|
|
|
|
do_test (4, 0, 4, 4, n, BIG_CHAR);
|
|
|
|
do_test (0, 0, 8, 8, n, SMALL_CHAR);
|
|
|
|
do_test (0, 8, 8, 8, n, SMALL_CHAR);
|
2013-06-04 19:18:56 +08:00
|
|
|
|
|
|
|
for (i = 1; i < 8; ++i)
|
|
|
|
{
|
2015-08-26 16:26:22 +08:00
|
|
|
do_test (0, 0, 8 << i, 8 << i, n, SMALL_CHAR);
|
|
|
|
do_test (8 - i, 2 * i, 8 << i, 8 << i, n, SMALL_CHAR);
|
|
|
|
do_test (0, 0, 8 << i, 2 << i, n, SMALL_CHAR);
|
|
|
|
do_test (8 - i, 2 * i, 8 << i, 2 << i, n, SMALL_CHAR);
|
2013-06-04 19:18:56 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 1; i < 8; ++i)
|
|
|
|
{
|
2015-08-26 16:26:22 +08:00
|
|
|
do_test (i, 2 * i, 8 << i, 1, n, SMALL_CHAR);
|
|
|
|
do_test (2 * i, i, 8 << i, 1, n, BIG_CHAR);
|
|
|
|
do_test (i, i, 8 << i, 10, n, SMALL_CHAR);
|
2013-06-04 19:18:56 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|