/* Measure strncat 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/>.  */

#define TEST_MAIN

#ifndef WIDE

# define TEST_NAME "strncat"

#else

# define TEST_NAME "wcsncat"

#endif /* WIDE */

#include "bench-string.h"

#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)

{

  CHAR *ret = dst;

  while (*dst++ != '\0');

  --dst;

  while (n--)

    if ((*dst++ = *src++) == '\0')

      return ret;

  *dst = '\0';

  return ret;

}

static void

do_one_test (impl_t *impl, CHAR *dst, const CHAR *src, size_t n)

{

  size_t k = STRLEN (dst), i, iters = INNER_LOOP_ITERS;

  timing_t start, stop, cur;

  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;

    }

  size_t len = STRLEN (src);

  if (MEMCMP (dst + k, src, len + 1 > n ? n : len + 1) != 0)

    {

      error (0, 0, "Incorrect concatenation in function %s",

	     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;

    }

  TIMING_NOW (start);

  for (i = 0; i < iters; ++i)

    {

      dst[k] = '\0';

      CALL (impl, dst, src, 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 len1, size_t len2,

	 size_t n, int max_char)

{

  size_t i;

  CHAR *s1, *s2;

  align1 &= 7;

  if ((align1 + len1) * sizeof (CHAR) >= page_size)

    return;

  if ((align1 + n) * sizeof (CHAR) > page_size)

    return;

  align2 &= 7;

  if ((align2 + len1 + len2) * sizeof (CHAR) >= page_size)

    return;

  if ((align2 + len1 + n) * sizeof (CHAR) > page_size)

    return;

  s1 = (CHAR *) (buf1) + align1;

  s2 = (CHAR *) (buf2) + align2;

  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);

  printf ("Length %4zd/%4zd, alignment %2zd/%2zd, N %4zd:",

	  len1, len2, align1, align2, n);

  FOR_EACH_IMPL (impl, 0)

    {

      s2[len2] = '\0';

      do_one_test (impl, s2, s1, n);

    }

  putchar ('\n');

}

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)

    {

      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);

      for (i = 1; i < 8; ++i)

	{

	  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);

	}

      for (i = 1; i < 8; ++i)

	{

	  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);

	}

    }

  return ret;

}