[thirdparty/glibc.git] / benchtests / bench-strncmp.c

/* Measure strncmp functions.
   Copyright (C) 2013-2020 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
   <https://www.gnu.org/licenses/>.  */

#define TEST_MAIN
#ifdef WIDE
# define TEST_NAME "wcsncmp"
#else
# define TEST_NAME "strncmp"
#endif /* !WIDE */
#include "bench-string.h"
#include "json-lib.h"

#ifdef WIDE
# define L(str) L##str
# define STRDUP wcsdup
# define SIMPLE_STRNCMP simple_wcsncmp

/* Wcsncmp uses signed semantics for comparison, not unsigned.
   Avoid using substraction since possible overflow.  */
int
simple_wcsncmp (const CHAR *s1, const CHAR *s2, size_t n)
{
  wchar_t c1, c2;

  while (n--)
    {
      c1 = *s1++;
      c2 = *s2++;
      if (c1 == L ('\0') || c1 != c2)
	return c1 > c2 ? 1 : (c1 < c2 ? -1 : 0);
    }
  return 0;
}

#else
# define L(str) str
# define STRDUP strdup
# define SIMPLE_STRNCMP simple_strncmp

/* Strncmp uses unsigned semantics for comparison.  */
int
simple_strncmp (const char *s1, const char *s2, size_t n)
{
  int ret = 0;

  while (n-- && (ret = *(unsigned char *) s1 - * (unsigned char *) s2++) == 0
	 && *s1++);
  return ret;
}

#endif /* !WIDE */

typedef int (*proto_t) (const CHAR *, const CHAR *, size_t);

IMPL (SIMPLE_STRNCMP, 0)
IMPL (STRNCMP, 1)


static void
do_one_test (json_ctx_t *json_ctx, impl_t *impl, const CHAR *s1, const CHAR
	     *s2, size_t n, int exp_result)
{
  size_t i, iters = INNER_LOOP_ITERS8;
  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);

  json_element_double (json_ctx, (double) cur / (double) iters);
}

static void
do_test_limit (json_ctx_t *json_ctx, size_t align1, size_t align2, size_t len,
	       size_t n, int max_char, int exp_result)
{
  size_t i, align_n;
  CHAR *s1, *s2;

  align1 &= 15;
  align2 &= 15;
  align_n = (page_size - n * CHARBYTES) & 15;

  json_element_object_begin (json_ctx);
  json_attr_uint (json_ctx, "strlen", (double) len);
  json_attr_uint (json_ctx, "len", (double) n);
  json_attr_uint (json_ctx, "align1", (double) align1);
  json_attr_uint (json_ctx, "align2", (double) align2);
  json_array_begin (json_ctx, "timings");

  FOR_EACH_IMPL (impl, 0)
    {
      alloc_bufs ();
      s1 = (CHAR *) (buf1 + page_size - n * CHARBYTES);
      s2 = (CHAR *) (buf2 + page_size - n * CHARBYTES);

      if (align1 < align_n)
	s1 = (CHAR *) ((char *) s1 - (align_n - align1));

      if (align2 < align_n)
	s2 = (CHAR *) ((char *) s2 - (align_n - align2));

      for (i = 0; i < n; i++)
	s1[i] = s2[i] = 1 + 23 * i % max_char;

      if (len < n)
	{
	  s1[len] = 0;
	  s2[len] = 0;
	  if (exp_result < 0)
	    s2[len] = 32;
	  else if (exp_result > 0)
	    s1[len] = 64;
	}

      do_one_test (json_ctx, impl, s1, s2, n, exp_result);
    }

  json_array_end (json_ctx);
  json_element_object_end (json_ctx);
}

static void
do_test (json_ctx_t *json_ctx, size_t align1, size_t align2, size_t len, size_t
	 n, int max_char, int exp_result)
{
  size_t i;
  CHAR *s1, *s2;

  if (n == 0)
    return;

  align1 &= 63;
  if (align1 + (n + 1) * CHARBYTES >= page_size)
    return;

  align2 &= 7;
  if (align2 + (n + 1) * CHARBYTES >= page_size)
    return;

  json_element_object_begin (json_ctx);
  json_attr_uint (json_ctx, "strlen", (double) len);
  json_attr_uint (json_ctx, "len", (double) n);
  json_attr_uint (json_ctx, "align1", (double) align1);
  json_attr_uint (json_ctx, "align2", (double) align2);
  json_array_begin (json_ctx, "timings");

  FOR_EACH_IMPL (impl, 0)
    {
      alloc_bufs ();
      s1 = (CHAR *) (buf1 + align1);
      s2 = (CHAR *) (buf2 + align2);

      for (i = 0; i < n; i++)
	s1[i] = s2[i] = 1 + (23 << ((CHARBYTES - 1) * 8)) * i % max_char;

      s1[n] = 24 + exp_result;
      s2[n] = 23;
      s1[len] = 0;
      s2[len] = 0;
      if (exp_result < 0)
	s2[len] = 32;
      else if (exp_result > 0)
	s1[len] = 64;
      if (len >= n)
	s2[n - 1] -= exp_result;

      do_one_test (json_ctx, impl, s1, s2, n, exp_result);
    }

  json_array_end (json_ctx);
  json_element_object_end (json_ctx);
}

static void
do_one_test_page_boundary (json_ctx_t *json_ctx, CHAR *s1, CHAR *s2,
			   size_t align1, size_t align2, size_t len,
			   size_t n, int exp_result)
{
  json_element_object_begin (json_ctx);
  json_attr_uint (json_ctx, "strlen", (double) len);
  json_attr_uint (json_ctx, "len", (double) n);
  json_attr_uint (json_ctx, "align1", (double) align1);
  json_attr_uint (json_ctx, "align2", (double) align2);
  json_array_begin (json_ctx, "timings");
  FOR_EACH_IMPL (impl, 0)
    do_one_test (json_ctx, impl, s1, s2, n, exp_result);
  json_array_end (json_ctx);
  json_element_object_end (json_ctx);
}

static void
do_test_page_boundary (json_ctx_t *json_ctx)
{
  /* To trigger bug 25933, we need a size that is equal to the vector
     length times 4. In the case of AVX2 for Intel, we need 32 * 4.  We
     make this test generic and run it for all architectures as additional
     boundary testing for such related algorithms.  */
  size_t size = 32 * 4;
  size_t len;
  CHAR *s1 = (CHAR *) (buf1 + (BUF1PAGES - 1) * page_size);
  CHAR *s2 = (CHAR *) (buf2 + (BUF1PAGES - 1) * page_size);
  int exp_result;

  memset (s1, 'a', page_size);
  memset (s2, 'a', page_size);

  s1[(page_size / CHARBYTES) - 1] = (CHAR) 0;

  /* Iterate over a size that is just below where we expect the bug to
     trigger up to the size we expect will trigger the bug e.g. [99-128].
     Likewise iterate the start of two strings between 30 and 31 bytes
     away from the boundary to simulate alignment changes.  */
  for (size_t s = 99; s <= size; s++)
    for (size_t s1a = 30; s1a < 32; s1a++)
      for (size_t s2a = 30; s2a < 32; s2a++)
	{
	  size_t align1 = (page_size / CHARBYTES - s) - s1a;
	  size_t align2 = (page_size / CHARBYTES - s) - s2a;
	  CHAR *s1p = s1 + align1;
	  CHAR *s2p = s2 + align2;
	  len = (page_size / CHARBYTES) - 1 - align1;
	  exp_result = SIMPLE_STRNCMP (s1p, s2p, s);
	  do_one_test_page_boundary (json_ctx, s1p, s2p, align1, align2,
				     len, s, exp_result);
	}
}

static void
do_one_test_page (json_ctx_t *json_ctx, size_t offset1, size_t offset2,
		  CHAR *s2)
{
  CHAR *s1;
  int exp_result;

  if (offset1 * CHARBYTES  >= page_size
      || offset2 * CHARBYTES >= page_size)
    return;

  s1 = (CHAR *) buf1;
  s1 += offset1;
  s2 += offset2;

  size_t len = (page_size / CHARBYTES) - offset1;

  exp_result= *s1;

  json_element_object_begin (json_ctx);
  json_attr_uint (json_ctx, "strlen", (double) len);
  json_attr_uint (json_ctx, "len", (double) page_size);
  json_attr_uint (json_ctx, "align1", (double) offset1);
  json_attr_uint (json_ctx, "align2", (double) offset2);
  json_array_begin (json_ctx, "timings");
  {
    FOR_EACH_IMPL (impl, 0)
      do_one_test (json_ctx, impl, s1, s2, page_size, -exp_result);
  }
  json_array_end (json_ctx);
  json_element_object_end (json_ctx);

  json_element_object_begin (json_ctx);
  json_attr_uint (json_ctx, "strlen", (double) len);
  json_attr_uint (json_ctx, "len", (double) page_size);
  json_attr_uint (json_ctx, "align1", (double) offset1);
  json_attr_uint (json_ctx, "align2", (double) offset2);
  json_array_begin (json_ctx, "timings");
  {
    FOR_EACH_IMPL (impl, 0)
      do_one_test (json_ctx, impl, s1, s2, page_size, exp_result);
  }
  json_array_end (json_ctx);
  json_element_object_end (json_ctx);
}

static void
do_test_page (json_ctx_t *json_ctx)
{
  size_t i;
  CHAR *s1, *s2;

  s1 = (CHAR *) buf1;
  /* Fill buf1 with 23. */
  for (i = 0; i < (page_size / CHARBYTES) - 1; i++)
    s1[i] = 23;
  s1[i] = 0;

  /* Make a copy of buf1.  */
  s2 = STRDUP (s1);

  /* Test should terminate within the page boundary.  */
  for (i = 0; i < (108 / CHARBYTES); ++i)
    do_one_test_page (json_ctx, ((page_size - 108) / CHARBYTES) + i,
		      ((page_size - 1460) / CHARBYTES), s2);

  free (s2);
}

int
test_main (void)
{
  json_ctx_t json_ctx;
  size_t i;

  test_init ();

  json_init (&json_ctx, 0, stdout);

  json_document_begin (&json_ctx);
  json_attr_string (&json_ctx, "timing_type", TIMING_TYPE);

  json_attr_object_begin (&json_ctx, "functions");
  json_attr_object_begin (&json_ctx, TEST_NAME);
  json_attr_string (&json_ctx, "bench-variant", "default");

  json_array_begin (&json_ctx, "ifuncs");
  FOR_EACH_IMPL (impl, 0)
    json_element_string (&json_ctx, impl->name);
  json_array_end (&json_ctx);

  json_array_begin (&json_ctx, "results");

  for (i =0; i < 16; ++i)
    {
      do_test (&json_ctx, 0, 0, 8, i, 127, 0);
      do_test (&json_ctx, 0, 0, 8, i, 127, -1);
      do_test (&json_ctx, 0, 0, 8, i, 127, 1);
      do_test (&json_ctx, i, i, 8, i, 127, 0);
      do_test (&json_ctx, i, i, 8, i, 127, 1);
      do_test (&json_ctx, i, i, 8, i, 127, -1);
      do_test (&json_ctx, i, 2 * i, 8, i, 127, 0);
      do_test (&json_ctx, 2 * i, i, 8, i, 127, 1);
      do_test (&json_ctx, i, 3 * i, 8, i, 127, -1);
      do_test (&json_ctx, 0, 0, 8, i, 255, 0);
      do_test (&json_ctx, 0, 0, 8, i, 255, -1);
      do_test (&json_ctx, 0, 0, 8, i, 255, 1);
      do_test (&json_ctx, i, i, 8, i, 255, 0);
      do_test (&json_ctx, i, i, 8, i, 255, 1);
      do_test (&json_ctx, i, i, 8, i, 255, -1);
      do_test (&json_ctx, i, 2 * i, 8, i, 255, 0);
      do_test (&json_ctx, 2 * i, i, 8, i, 255, 1);
      do_test (&json_ctx, i, 3 * i, 8, i, 255, -1);
    }

  for (i = 1; i < 8; ++i)
    {
      do_test (&json_ctx, 0, 0, 8 << i, 16 << i, 127, 0);
      do_test (&json_ctx, 0, 0, 8 << i, 16 << i, 127, 1);
      do_test (&json_ctx, 0, 0, 8 << i, 16 << i, 127, -1);
      do_test (&json_ctx, 0, 0, 8 << i, 16 << i, 255, 0);
      do_test (&json_ctx, 0, 0, 8 << i, 16 << i, 255, 1);
      do_test (&json_ctx, 0, 0, 8 << i, 16 << i, 255, -1);
      do_test (&json_ctx, 8 - i, 2 * i, 8 << i, 16 << i, 127, 0);
      do_test (&json_ctx, 8 - i, 2 * i, 8 << i, 16 << i, 127, 1);
      do_test (&json_ctx, 2 * i, i, 8 << i, 16 << i, 255, 0);
      do_test (&json_ctx, 2 * i, i, 8 << i, 16 << i, 255, 1);
    }

  do_test_limit (&json_ctx, 4, 0, 21, 20, 127, 0);
  do_test_limit (&json_ctx, 0, 4, 21, 20, 127, 0);
  do_test_limit (&json_ctx, 8, 0, 25, 24, 127, 0);
  do_test_limit (&json_ctx, 0, 8, 25, 24, 127, 0);

  for (i = 0; i < 8; ++i)
    {
      do_test_limit (&json_ctx, 0, 0, 17 - i, 16 - i, 127, 0);
      do_test_limit (&json_ctx, 0, 0, 17 - i, 16 - i, 255, 0);
      do_test_limit (&json_ctx, 0, 0, 15 - i, 16 - i, 127, 0);
      do_test_limit (&json_ctx, 0, 0, 15 - i, 16 - i, 127, 1);
      do_test_limit (&json_ctx, 0, 0, 15 - i, 16 - i, 127, -1);
      do_test_limit (&json_ctx, 0, 0, 15 - i, 16 - i, 255, 0);
      do_test_limit (&json_ctx, 0, 0, 15 - i, 16 - i, 255, 1);
      do_test_limit (&json_ctx, 0, 0, 15 - i, 16 - i, 255, -1);
    }

  do_test_page_boundary (&json_ctx);
  do_test_page (&json_ctx);

  json_array_end (&json_ctx);
  json_attr_object_end (&json_ctx);
  json_attr_object_end (&json_ctx);
  json_document_end (&json_ctx);

  return ret;
}

#include <support/test-driver.c>
Commit	Line	Data
97020474	1	/* Measure strncmp functions.
d614a753	2	Copyright (C) 2013-2020 Free Software Foundation, Inc.
97020474 SP	3	This file is part of the GNU C Library.
	4
	5	The GNU C Library is free software; you can redistribute it and/or
	6	modify it under the terms of the GNU Lesser General Public
	7	License as published by the Free Software Foundation; either
	8	version 2.1 of the License, or (at your option) any later version.
	9
	10	The GNU C Library is distributed in the hope that it will be useful,
	11	but WITHOUT ANY WARRANTY; without even the implied warranty of
	12	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	13	Lesser General Public License for more details.
	14
	15	You should have received a copy of the GNU Lesser General Public
	16	License along with the GNU C Library; if not, see
5a82c748	17	<https://www.gnu.org/licenses/>. */
97020474 SP	18
97020474 SP	19	#define TEST_MAIN
cee82e70 SL	20	#ifdef WIDE
	21	# define TEST_NAME "wcsncmp"
	22	#else
	23	# define TEST_NAME "strncmp"
	24	#endif /* !WIDE */
97020474	25	#include "bench-string.h"
ad4e816e	26	#include "json-lib.h"
97020474	27
cee82e70	28	#ifdef WIDE
cee82e70	29	# define L(str) L##str
c4277ba2	30	# define STRDUP wcsdup
cee82e70	31	# define SIMPLE_STRNCMP simple_wcsncmp
97020474	32
cee82e70 SL	33	/* Wcsncmp uses signed semantics for comparison, not unsigned.
	34	Avoid using substraction since possible overflow. */
	35	int
	36	simple_wcsncmp (const CHAR s1, const CHAR s2, size_t n)
	37	{
	38	wchar_t c1, c2;
	39
	40	while (n--)
	41	{
	42	c1 = *s1++;
	43	c2 = *s2++;
	44	if (c1 == L ('\0') \|\| c1 != c2)
	45	return c1 > c2 ? 1 : (c1 < c2 ? -1 : 0);
	46	}
	47	return 0;
	48	}
	49
cee82e70 SL	50	#else
cee82e70 SL	51	# define L(str) str
c4277ba2	52	# define STRDUP strdup
cee82e70	53	# define SIMPLE_STRNCMP simple_strncmp
cee82e70 SL	54
cee82e70 SL	55	/* Strncmp uses unsigned semantics for comparison. */
97020474 SP	56	int
	57	simple_strncmp (const char s1, const char s2, size_t n)
	58	{
	59	int ret = 0;
	60
	61	while (n-- && (ret = (unsigned char ) s1 - * (unsigned char *) s2++) == 0
	62	&& *s1++);
	63	return ret;
	64	}
	65
cee82e70 SL	66	#endif /* !WIDE */
	67
	68	typedef int (proto_t) (const CHAR , const CHAR *, size_t);
	69
cee82e70 SL	70	IMPL (SIMPLE_STRNCMP, 0)
	71	IMPL (STRNCMP, 1)
	72
	73
97020474	74	static void
ad4e816e SP	75	do_one_test (json_ctx_t json_ctx, impl_t impl, const CHAR *s1, const CHAR
ad4e816e SP	76	*s2, size_t n, int exp_result)
97020474	77	{
d0645912	78	size_t i, iters = INNER_LOOP_ITERS8;
44558701 WN	79	timing_t start, stop, cur;
	80
	81	TIMING_NOW (start);
	82	for (i = 0; i < iters; ++i)
97020474	83	{
44558701	84	CALL (impl, s1, s2, n);
97020474	85	}
44558701 WN	86	TIMING_NOW (stop);
	87
	88	TIMING_DIFF (cur, start, stop);
	89
ad4e816e	90	json_element_double (json_ctx, (double) cur / (double) iters);
97020474 SP	91	}
	92
	93	static void
ad4e816e SP	94	do_test_limit (json_ctx_t *json_ctx, size_t align1, size_t align2, size_t len,
ad4e816e SP	95	size_t n, int max_char, int exp_result)
97020474 SP	96	{
97020474 SP	97	size_t i, align_n;
cee82e70	98	CHAR s1, s2;
97020474	99
97020474 SP	100	align1 &= 15;
97020474 SP	101	align2 &= 15;
cee82e70	102	align_n = (page_size - n * CHARBYTES) & 15;
97020474	103
ad4e816e SP	104	json_element_object_begin (json_ctx);
	105	json_attr_uint (json_ctx, "strlen", (double) len);
	106	json_attr_uint (json_ctx, "len", (double) n);
	107	json_attr_uint (json_ctx, "align1", (double) align1);
	108	json_attr_uint (json_ctx, "align2", (double) align2);
	109	json_array_begin (json_ctx, "timings");
97020474 SP	110
97020474 SP	111	FOR_EACH_IMPL (impl, 0)
7bb3a8a5	112	{
014efdd7	113	alloc_bufs ();
7bb3a8a5 SP	114	s1 = (CHAR ) (buf1 + page_size - n CHARBYTES);
	115	s2 = (CHAR ) (buf2 + page_size - n CHARBYTES);
	116
	117	if (align1 < align_n)
	118	s1 = (CHAR ) ((char ) s1 - (align_n - align1));
	119
	120	if (align2 < align_n)
	121	s2 = (CHAR ) ((char ) s2 - (align_n - align2));
	122
	123	for (i = 0; i < n; i++)
	124	s1[i] = s2[i] = 1 + 23 * i % max_char;
	125
	126	if (len < n)
	127	{
	128	s1[len] = 0;
	129	s2[len] = 0;
	130	if (exp_result < 0)
	131	s2[len] = 32;
	132	else if (exp_result > 0)
	133	s1[len] = 64;
	134	}
	135
	136	do_one_test (json_ctx, impl, s1, s2, n, exp_result);
	137	}
97020474	138
ad4e816e SP	139	json_array_end (json_ctx);
ad4e816e SP	140	json_element_object_end (json_ctx);
97020474 SP	141	}
	142
	143	static void
ad4e816e SP	144	do_test (json_ctx_t *json_ctx, size_t align1, size_t align2, size_t len, size_t
ad4e816e SP	145	n, int max_char, int exp_result)
97020474 SP	146	{
97020474 SP	147	size_t i;
cee82e70	148	CHAR s1, s2;
97020474 SP	149
	150	if (n == 0)
	151	return;
	152
cee82e70 SL	153	align1 &= 63;
cee82e70 SL	154	if (align1 + (n + 1) * CHARBYTES >= page_size)
97020474 SP	155	return;
	156
	157	align2 &= 7;
cee82e70	158	if (align2 + (n + 1) * CHARBYTES >= page_size)
97020474 SP	159	return;
97020474 SP	160
ad4e816e SP	161	json_element_object_begin (json_ctx);
	162	json_attr_uint (json_ctx, "strlen", (double) len);
	163	json_attr_uint (json_ctx, "len", (double) n);
	164	json_attr_uint (json_ctx, "align1", (double) align1);
	165	json_attr_uint (json_ctx, "align2", (double) align2);
	166	json_array_begin (json_ctx, "timings");
97020474 SP	167
97020474 SP	168	FOR_EACH_IMPL (impl, 0)
7bb3a8a5	169	{
014efdd7	170	alloc_bufs ();
7bb3a8a5 SP	171	s1 = (CHAR *) (buf1 + align1);
	172	s2 = (CHAR *) (buf2 + align2);
	173
	174	for (i = 0; i < n; i++)
	175	s1[i] = s2[i] = 1 + (23 << ((CHARBYTES - 1) * 8)) * i % max_char;
	176
	177	s1[n] = 24 + exp_result;
	178	s2[n] = 23;
	179	s1[len] = 0;
	180	s2[len] = 0;
	181	if (exp_result < 0)
	182	s2[len] = 32;
	183	else if (exp_result > 0)
	184	s1[len] = 64;
	185	if (len >= n)
	186	s2[n - 1] -= exp_result;
	187
	188	do_one_test (json_ctx, impl, s1, s2, n, exp_result);
	189	}
97020474	190
ad4e816e SP	191	json_array_end (json_ctx);
ad4e816e SP	192	json_element_object_end (json_ctx);
97020474 SP	193	}
97020474 SP	194
c4277ba2 L	195	static void
	196	do_one_test_page_boundary (json_ctx_t json_ctx, CHAR s1, CHAR *s2,
	197	size_t align1, size_t align2, size_t len,
	198	size_t n, int exp_result)
	199	{
	200	json_element_object_begin (json_ctx);
	201	json_attr_uint (json_ctx, "strlen", (double) len);
	202	json_attr_uint (json_ctx, "len", (double) n);
	203	json_attr_uint (json_ctx, "align1", (double) align1);
	204	json_attr_uint (json_ctx, "align2", (double) align2);
	205	json_array_begin (json_ctx, "timings");
	206	FOR_EACH_IMPL (impl, 0)
	207	do_one_test (json_ctx, impl, s1, s2, n, exp_result);
	208	json_array_end (json_ctx);
	209	json_element_object_end (json_ctx);
	210	}
	211
	212	static void
	213	do_test_page_boundary (json_ctx_t *json_ctx)
	214	{
	215	/* To trigger bug 25933, we need a size that is equal to the vector
	216	length times 4. In the case of AVX2 for Intel, we need 32 * 4. We
	217	make this test generic and run it for all architectures as additional
	218	boundary testing for such related algorithms. */
	219	size_t size = 32 * 4;
	220	size_t len;
	221	CHAR s1 = (CHAR ) (buf1 + (BUF1PAGES - 1) * page_size);
	222	CHAR s2 = (CHAR ) (buf2 + (BUF1PAGES - 1) * page_size);
	223	int exp_result;
	224
	225	memset (s1, 'a', page_size);
	226	memset (s2, 'a', page_size);
	227
	228	s1[(page_size / CHARBYTES) - 1] = (CHAR) 0;
	229
	230	/* Iterate over a size that is just below where we expect the bug to
	231	trigger up to the size we expect will trigger the bug e.g. [99-128].
	232	Likewise iterate the start of two strings between 30 and 31 bytes
	233	away from the boundary to simulate alignment changes. */
	234	for (size_t s = 99; s <= size; s++)
	235	for (size_t s1a = 30; s1a < 32; s1a++)
	236	for (size_t s2a = 30; s2a < 32; s2a++)
	237	{
	238	size_t align1 = (page_size / CHARBYTES - s) - s1a;
	239	size_t align2 = (page_size / CHARBYTES - s) - s2a;
	240	CHAR *s1p = s1 + align1;
	241	CHAR *s2p = s2 + align2;
	242	len = (page_size / CHARBYTES) - 1 - align1;
	243	exp_result = SIMPLE_STRNCMP (s1p, s2p, s);
	244	do_one_test_page_boundary (json_ctx, s1p, s2p, align1, align2,
	245	len, s, exp_result);
	246	}
	247	}
	248
	249	static void
	250	do_one_test_page (json_ctx_t *json_ctx, size_t offset1, size_t offset2,
	251	CHAR *s2)
	252	{
	253	CHAR *s1;
	254	int exp_result;
	255
	256	if (offset1 * CHARBYTES >= page_size
	257	\|\| offset2 * CHARBYTES >= page_size)
	258	return;
259
260	s1 = (CHAR *) buf1;
261	s1 += offset1;
262	s2 += offset2;
263
264	size_t len = (page_size / CHARBYTES) - offset1;
265
266	exp_result= *s1;
267
268	json_element_object_begin (json_ctx);
269	json_attr_uint (json_ctx, "strlen", (double) len);
270	json_attr_uint (json_ctx, "len", (double) page_size);
271	json_attr_uint (json_ctx, "align1", (double) offset1);
272	json_attr_uint (json_ctx, "align2", (double) offset2);
273	json_array_begin (json_ctx, "timings");
274	{
275	FOR_EACH_IMPL (impl, 0)
276	do_one_test (json_ctx, impl, s1, s2, page_size, -exp_result);
277	}
278	json_array_end (json_ctx);
279	json_element_object_end (json_ctx);
280
281	json_element_object_begin (json_ctx);
282	json_attr_uint (json_ctx, "strlen", (double) len);
283	json_attr_uint (json_ctx, "len", (double) page_size);
284	json_attr_uint (json_ctx, "align1", (double) offset1);
285	json_attr_uint (json_ctx, "align2", (double) offset2);
286	json_array_begin (json_ctx, "timings");
287	{
288	FOR_EACH_IMPL (impl, 0)
289	do_one_test (json_ctx, impl, s1, s2, page_size, exp_result);
290	}
291	json_array_end (json_ctx);
292	json_element_object_end (json_ctx);
293	}
294
295	static void
296	do_test_page (json_ctx_t *json_ctx)
297	{
298	size_t i;
299	CHAR s1, s2;
300
301	s1 = (CHAR *) buf1;
302	/* Fill buf1 with 23. */
303	for (i = 0; i < (page_size / CHARBYTES) - 1; i++)
304	s1[i] = 23;
305	s1[i] = 0;
306
307	/* Make a copy of buf1. */
308	s2 = STRDUP (s1);
309
310	/* Test should terminate within the page boundary. */
311	for (i = 0; i < (108 / CHARBYTES); ++i)
312	do_one_test_page (json_ctx, ((page_size - 108) / CHARBYTES) + i,
313	((page_size - 1460) / CHARBYTES), s2);
314
315	free (s2);
316	}
317
97020474 SP	318	int
	319	test_main (void)
	320	{
ad4e816e	321	json_ctx_t json_ctx;
97020474 SP	322	size_t i;
	323
	324	test_init ();
	325
ad4e816e SP	326	json_init (&json_ctx, 0, stdout);
	327
	328	json_document_begin (&json_ctx);
	329	json_attr_string (&json_ctx, "timing_type", TIMING_TYPE);
	330
	331	json_attr_object_begin (&json_ctx, "functions");
	332	json_attr_object_begin (&json_ctx, TEST_NAME);
	333	json_attr_string (&json_ctx, "bench-variant", "default");
	334
	335	json_array_begin (&json_ctx, "ifuncs");
97020474	336	FOR_EACH_IMPL (impl, 0)
ad4e816e SP	337	json_element_string (&json_ctx, impl->name);
	338	json_array_end (&json_ctx);
	339
	340	json_array_begin (&json_ctx, "results");
97020474 SP	341
	342	for (i =0; i < 16; ++i)
	343	{
ad4e816e SP	344	do_test (&json_ctx, 0, 0, 8, i, 127, 0);
	345	do_test (&json_ctx, 0, 0, 8, i, 127, -1);
	346	do_test (&json_ctx, 0, 0, 8, i, 127, 1);
	347	do_test (&json_ctx, i, i, 8, i, 127, 0);
	348	do_test (&json_ctx, i, i, 8, i, 127, 1);
	349	do_test (&json_ctx, i, i, 8, i, 127, -1);
	350	do_test (&json_ctx, i, 2 * i, 8, i, 127, 0);
	351	do_test (&json_ctx, 2 * i, i, 8, i, 127, 1);
	352	do_test (&json_ctx, i, 3 * i, 8, i, 127, -1);
	353	do_test (&json_ctx, 0, 0, 8, i, 255, 0);
	354	do_test (&json_ctx, 0, 0, 8, i, 255, -1);
	355	do_test (&json_ctx, 0, 0, 8, i, 255, 1);
	356	do_test (&json_ctx, i, i, 8, i, 255, 0);
	357	do_test (&json_ctx, i, i, 8, i, 255, 1);
	358	do_test (&json_ctx, i, i, 8, i, 255, -1);
	359	do_test (&json_ctx, i, 2 * i, 8, i, 255, 0);
	360	do_test (&json_ctx, 2 * i, i, 8, i, 255, 1);
	361	do_test (&json_ctx, i, 3 * i, 8, i, 255, -1);
97020474 SP	362	}
	363
	364	for (i = 1; i < 8; ++i)
	365	{
ad4e816e SP	366	do_test (&json_ctx, 0, 0, 8 << i, 16 << i, 127, 0);
	367	do_test (&json_ctx, 0, 0, 8 << i, 16 << i, 127, 1);
	368	do_test (&json_ctx, 0, 0, 8 << i, 16 << i, 127, -1);
	369	do_test (&json_ctx, 0, 0, 8 << i, 16 << i, 255, 0);
	370	do_test (&json_ctx, 0, 0, 8 << i, 16 << i, 255, 1);
	371	do_test (&json_ctx, 0, 0, 8 << i, 16 << i, 255, -1);
	372	do_test (&json_ctx, 8 - i, 2 * i, 8 << i, 16 << i, 127, 0);
	373	do_test (&json_ctx, 8 - i, 2 * i, 8 << i, 16 << i, 127, 1);
	374	do_test (&json_ctx, 2 * i, i, 8 << i, 16 << i, 255, 0);
	375	do_test (&json_ctx, 2 * i, i, 8 << i, 16 << i, 255, 1);
97020474 SP	376	}
97020474 SP	377
ad4e816e SP	378	do_test_limit (&json_ctx, 4, 0, 21, 20, 127, 0);
	379	do_test_limit (&json_ctx, 0, 4, 21, 20, 127, 0);
	380	do_test_limit (&json_ctx, 8, 0, 25, 24, 127, 0);
	381	do_test_limit (&json_ctx, 0, 8, 25, 24, 127, 0);
97020474 SP	382
	383	for (i = 0; i < 8; ++i)
	384	{
ad4e816e SP	385	do_test_limit (&json_ctx, 0, 0, 17 - i, 16 - i, 127, 0);
	386	do_test_limit (&json_ctx, 0, 0, 17 - i, 16 - i, 255, 0);
	387	do_test_limit (&json_ctx, 0, 0, 15 - i, 16 - i, 127, 0);
	388	do_test_limit (&json_ctx, 0, 0, 15 - i, 16 - i, 127, 1);
	389	do_test_limit (&json_ctx, 0, 0, 15 - i, 16 - i, 127, -1);
	390	do_test_limit (&json_ctx, 0, 0, 15 - i, 16 - i, 255, 0);
	391	do_test_limit (&json_ctx, 0, 0, 15 - i, 16 - i, 255, 1);
	392	do_test_limit (&json_ctx, 0, 0, 15 - i, 16 - i, 255, -1);
97020474 SP	393	}
97020474 SP	394
c4277ba2 L	395	do_test_page_boundary (&json_ctx);
	396	do_test_page (&json_ctx);
	397
ad4e816e SP	398	json_array_end (&json_ctx);
	399	json_attr_object_end (&json_ctx);
	400	json_attr_object_end (&json_ctx);
	401	json_document_end (&json_ctx);
	402
97020474 SP	403	return ret;
	404	}
	405
b598e134	406	#include <support/test-driver.c>