[thirdparty/glibc.git] / string / test-memccpy.c

/* Test and measure memccpy functions.
   Copyright (C) 1999-2012 Free Software Foundation, Inc.
   This file is part of the GNU C Library.
   Written by Jakub Jelinek <jakub@redhat.com>, 1999.

   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
#define TEST_NAME "memccpy"
#include "test-string.h"

void *simple_memccpy (void *, const void *, int, size_t);
void *stupid_memccpy (void *, const void *, int, size_t);

IMPL (stupid_memccpy, 0)
IMPL (simple_memccpy, 0)
IMPL (memccpy, 1)

void *
simple_memccpy (void *dst, const void *src, int c, size_t n)
{
  const char *s = src;
  char *d = dst;

  while (n-- > 0)
    if ((*d++ = *s++) == (char) c)
      return d;

  return NULL;
}

void *
stupid_memccpy (void *dst, const void *src, int c, size_t n)
{
  void *p = memchr (src, c, n);

  if (p != NULL)
    return mempcpy (dst, src, p - src + 1);

  memcpy (dst, src, n);
  return NULL;
}

typedef void *(*proto_t) (void *, const void *, int c, size_t);

static void
do_one_test (impl_t *impl, void *dst, const void *src, int c, size_t len,
	     size_t n)
{
  void *expect = len > n ? NULL : (char *) dst + len;
  if (CALL (impl, dst, src, c, n) != expect)
    {
      error (0, 0, "Wrong result in function %s %p %p", impl->name,
	     CALL (impl, dst, src, c, n), expect);
      ret = 1;
      return;
    }

  if (memcmp (dst, src, len > n ? n : len) != 0)
    {
      error (0, 0, "Wrong result in function %s", impl->name);
      ret = 1;
      return;
    }

  if (HP_TIMING_AVAIL)
    {
      hp_timing_t start __attribute__ ((unused));
      hp_timing_t stop __attribute__ ((unused));
      hp_timing_t best_time = ~ (hp_timing_t) 0;
      size_t i;

      for (i = 0; i < 32; ++i)
	{
	  HP_TIMING_NOW (start);
	  CALL (impl, dst, src, c, n);
	  HP_TIMING_NOW (stop);
	  HP_TIMING_BEST (best_time, start, stop);
	}

      printf ("\t%zd", (size_t) best_time);
    }
}

static void
do_test (size_t align1, size_t align2, int c, size_t len, size_t n,
	 int max_char)
{
  size_t i;
  char *s1, *s2;

  align1 &= 7;
  if (align1 + len >= page_size)
    return;

  align2 &= 7;
  if (align2 + len >= page_size)
    return;

  s1 = (char *) (buf1 + align1);
  s2 = (char *) (buf2 + align2);

  for (i = 0; i < len - 1; ++i)
    {
      s1[i] = 32 + 23 * i % (max_char - 32);
      if (s1[i] == (char) c)
	--s1[i];
    }
  s1[len - 1] = c;
  for (i = len; i + align1 < page_size && i < len + 64; ++i)
    s1[i] = 32 + 32 * i % (max_char - 32);

  if (HP_TIMING_AVAIL)
    printf ("Length %4zd, n %4zd, char %d, alignment %2zd/%2zd:", len, n, c, align1, align2);

  FOR_EACH_IMPL (impl, 0)
    do_one_test (impl, s2, s1, c, len, n);

  if (HP_TIMING_AVAIL)
    putchar ('\n');
}

static void
do_random_tests (void)
{
  size_t i, j, n, align1, align2, len, size, mode;
  unsigned char *p1 = buf1 + page_size - 512;
  unsigned char *p2 = buf2 + page_size - 512;
  unsigned char *res, c;

  for (n = 0; n < ITERATIONS; n++)
    {
      mode = random ();
      c = random ();
      if (mode & 1)
	{
	  size = random () & 255;
	  align1 = 512 - size - (random () & 15);
	  if (mode & 2)
	    align2 = align1 - (random () & 24);
	  else
	    align2 = align1 - (random () & 31);
	  if (mode & 4)
	    {
	      j = align1;
	      align1 = align2;
	      align2 = j;
	    }
	  if (mode & 8)
	    len = size - (random () & 31);
	  else
	    len = 512;
	  if (len >= 512)
	    len = random () & 511;
	}
      else
	{
	  align1 = random () & 31;
	  if (mode & 2)
	    align2 = random () & 31;
	  else
	    align2 = align1 + (random () & 24);
	  len = random () & 511;
	  j = align1;
	  if (align2 > j)
	    j = align2;
	  if (mode & 4)
	    {
	      size = random () & 511;
	      if (size + j > 512)
		size = 512 - j - (random() & 31);
	    }
	  else
	    size = 512 - j;
	  if ((mode & 8) && len + j >= 512)
	    len = 512 - j - (random () & 7);
	}
      j = len + align1 + 64;
      if (j > 512)
	j = 512;
      for (i = 0; i < j; i++)
	{
	  if (i == len + align1)
	    p1[i] = c;
	  else
	    {
	      p1[i] = random () & 255;
	      if (i >= align1 && i < len + align1 && p1[i] == c)
		p1[i] = (random () & 127) + 3 + c;
	    }
	}

      FOR_EACH_IMPL (impl, 1)
	{
	  unsigned char *expect;
	  memset (p2 - 64, '\1', 512 + 64);
	  res = CALL (impl, p2 + align2, p1 + align1, (char) c, size);
	  if (len >= size)
	    expect = NULL;
	  else
	    expect = p2 + align2 + len + 1;

	  if (res != expect)
	    {
	      error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %zd, %zd, %zd, %d) %p != %p",
		     n, impl->name, align1, align2, len, size, c, res, expect);
	      ret = 1;
	    }
	  for (j = 0; j < align2 + 64; ++j)
	    {
	      if (p2[j - 64] != '\1')
		{
		  error (0, 0, "Iteration %zd - garbage before, %s (%zd, %zd, %zd)",
			 n, impl->name, align1, align2, len);
		  ret = 1;
		  break;
		}
	    }
	  j = align2 + len + 1;
	  if (size + align2 < j)
	    j = size + align2;
	  for (; j < 512; ++j)
	    {
	      if (p2[j] != '\1')
		{
		  error (0, 0, "Iteration %zd - garbage after, %s (%zd, %zd, %zd)",
			 n, impl->name, align1, align2, len);
		  ret = 1;
		  break;
		}
	    }
	  j = len + 1;
	  if (size < j)
	    j = size;
	  if (memcmp (p1 + align1, p2 + align2, j))
	    {
	      error (0, 0, "Iteration %zd - different strings, %s (%zd, %zd, %zd)",
		     n, impl->name, align1, align2, len);
	      ret = 1;
	    }
	}
    }
}

int
test_main (void)
{
  size_t i;

  test_init ();

  printf ("%28s", "");
  FOR_EACH_IMPL (impl, 0)
    printf ("\t%s", impl->name);
  putchar ('\n');

  for (i = 1; i < 8; ++i)
    {
      do_test (i, i, 12, 16, 16, 127);
      do_test (i, i, 23, 16, 16, 255);
      do_test (i, 2 * i, 28, 16, 16, 127);
      do_test (2 * i, i, 31, 16, 16, 255);
      do_test (8 - i, 2 * i, 1, 1 << i, 2 << i, 127);
      do_test (2 * i, 8 - i, 17, 2 << i, 1 << i, 127);
      do_test (8 - i, 2 * i, 0, 1 << i, 2 << i, 255);
      do_test (2 * i, 8 - i, i, 2 << i, 1 << i, 255);
    }

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

  do_random_tests ();
  return ret;
}

#include "../test-skeleton.c"
Commit	Line	Data
cd94eda9	1	/* Test and measure memccpy functions.
69f07e5f	2	Copyright (C) 1999-2012 Free Software Foundation, Inc.
cd94eda9 UD	3	This file is part of the GNU C Library.
	4	Written by Jakub Jelinek <jakub@redhat.com>, 1999.
	5
	6	The GNU C Library is free software; you can redistribute it and/or
	7	modify it under the terms of the GNU Lesser General Public
	8	License as published by the Free Software Foundation; either
	9	version 2.1 of the License, or (at your option) any later version.
	10
	11	The GNU C Library is distributed in the hope that it will be useful,
	12	but WITHOUT ANY WARRANTY; without even the implied warranty of
	13	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	14	Lesser General Public License for more details.
	15
	16	You should have received a copy of the GNU Lesser General Public
59ba27a6 PE	17	License along with the GNU C Library; if not, see
59ba27a6 PE	18	<http://www.gnu.org/licenses/>. */
cd94eda9 UD	19
cd94eda9 UD	20	#define TEST_MAIN
69f07e5f	21	#define TEST_NAME "memccpy"
cd94eda9 UD	22	#include "test-string.h"
	23
	24	void simple_memccpy (void , const void *, int, size_t);
	25	void stupid_memccpy (void , const void *, int, size_t);
	26
	27	IMPL (stupid_memccpy, 0)
	28	IMPL (simple_memccpy, 0)
	29	IMPL (memccpy, 1)
	30
	31	void *
	32	simple_memccpy (void dst, const void src, int c, size_t n)
	33	{
	34	const char *s = src;
	35	char *d = dst;
	36
	37	while (n-- > 0)
	38	if ((d++ = s++) == (char) c)
	39	return d;
	40
	41	return NULL;
	42	}
	43
	44	void *
	45	stupid_memccpy (void dst, const void src, int c, size_t n)
	46	{
	47	void *p = memchr (src, c, n);
	48
	49	if (p != NULL)
	50	return mempcpy (dst, src, p - src + 1);
	51
	52	memcpy (dst, src, n);
	53	return NULL;
	54	}
	55
	56	typedef void (proto_t) (void , const void , int c, size_t);
	57
	58	static void
	59	do_one_test (impl_t impl, void dst, const void *src, int c, size_t len,
	60	size_t n)
	61	{
	62	void expect = len > n ? NULL : (char ) dst + len;
	63	if (CALL (impl, dst, src, c, n) != expect)
	64	{
	65	error (0, 0, "Wrong result in function %s %p %p", impl->name,
	66	CALL (impl, dst, src, c, n), expect);
	67	ret = 1;
	68	return;
	69	}
	70
	71	if (memcmp (dst, src, len > n ? n : len) != 0)
	72	{
	73	error (0, 0, "Wrong result in function %s", impl->name);
	74	ret = 1;
	75	return;
	76	}
	77
	78	if (HP_TIMING_AVAIL)
	79	{
	80	hp_timing_t start __attribute__ ((unused));
	81	hp_timing_t stop __attribute__ ((unused));
	82	hp_timing_t best_time = ~ (hp_timing_t) 0;
	83	size_t i;
	84
	85	for (i = 0; i < 32; ++i)
86	{
87	HP_TIMING_NOW (start);
88	CALL (impl, dst, src, c, n);
89	HP_TIMING_NOW (stop);
90	HP_TIMING_BEST (best_time, start, stop);
91	}
92
93	printf ("\t%zd", (size_t) best_time);
94	}
95	}
96
97	static void
98	do_test (size_t align1, size_t align2, int c, size_t len, size_t n,
99	int max_char)
100	{
101	size_t i;
102	char s1, s2;
103
104	align1 &= 7;
105	if (align1 + len >= page_size)
106	return;
107
108	align2 &= 7;
109	if (align2 + len >= page_size)
110	return;
111
0317eaec RM	112	s1 = (char *) (buf1 + align1);
0317eaec RM	113	s2 = (char *) (buf2 + align2);
cd94eda9 UD	114
	115	for (i = 0; i < len - 1; ++i)
	116	{
	117	s1[i] = 32 + 23 * i % (max_char - 32);
	118	if (s1[i] == (char) c)
	119	--s1[i];
	120	}
	121	s1[len - 1] = c;
	122	for (i = len; i + align1 < page_size && i < len + 64; ++i)
	123	s1[i] = 32 + 32 * i % (max_char - 32);
	124
	125	if (HP_TIMING_AVAIL)
	126	printf ("Length %4zd, n %4zd, char %d, alignment %2zd/%2zd:", len, n, c, align1, align2);
	127
	128	FOR_EACH_IMPL (impl, 0)
	129	do_one_test (impl, s2, s1, c, len, n);
	130
	131	if (HP_TIMING_AVAIL)
	132	putchar ('\n');
	133	}
	134
	135	static void
	136	do_random_tests (void)
	137	{
	138	size_t i, j, n, align1, align2, len, size, mode;
	139	unsigned char *p1 = buf1 + page_size - 512;
	140	unsigned char *p2 = buf2 + page_size - 512;
	141	unsigned char *res, c;
	142
	143	for (n = 0; n < ITERATIONS; n++)
	144	{
	145	mode = random ();
	146	c = random ();
	147	if (mode & 1)
	148	{
	149	size = random () & 255;
	150	align1 = 512 - size - (random () & 15);
	151	if (mode & 2)
	152	align2 = align1 - (random () & 24);
	153	else
	154	align2 = align1 - (random () & 31);
	155	if (mode & 4)
	156	{
	157	j = align1;
	158	align1 = align2;
	159	align2 = j;
	160	}
	161	if (mode & 8)
	162	len = size - (random () & 31);
	163	else
	164	len = 512;
	165	if (len >= 512)
	166	len = random () & 511;
	167	}
	168	else
	169	{
	170	align1 = random () & 31;
	171	if (mode & 2)
	172	align2 = random () & 31;
	173	else
	174	align2 = align1 + (random () & 24);
	175	len = random () & 511;
	176	j = align1;
	177	if (align2 > j)
178	j = align2;
179	if (mode & 4)
180	{
181	size = random () & 511;
182	if (size + j > 512)
183	size = 512 - j - (random() & 31);
184	}
185	else
186	size = 512 - j;
187	if ((mode & 8) && len + j >= 512)
188	len = 512 - j - (random () & 7);
189	}
190	j = len + align1 + 64;
191	if (j > 512)
192	j = 512;
193	for (i = 0; i < j; i++)
194	{
195	if (i == len + align1)
196	p1[i] = c;
197	else
198	{
199	p1[i] = random () & 255;
200	if (i >= align1 && i < len + align1 && p1[i] == c)
201	p1[i] = (random () & 127) + 3 + c;
202	}
203	}
204
205	FOR_EACH_IMPL (impl, 1)
206	{
207	unsigned char *expect;
208	memset (p2 - 64, '\1', 512 + 64);
209	res = CALL (impl, p2 + align2, p1 + align1, (char) c, size);
210	if (len >= size)
211	expect = NULL;
212	else
213	expect = p2 + align2 + len + 1;
214
215	if (res != expect)
216	{
217	error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %zd, %zd, %zd, %d) %p != %p",
218	n, impl->name, align1, align2, len, size, c, res, expect);
219	ret = 1;
220	}
221	for (j = 0; j < align2 + 64; ++j)
222	{
223	if (p2[j - 64] != '\1')
224	{
225	error (0, 0, "Iteration %zd - garbage before, %s (%zd, %zd, %zd)",
226	n, impl->name, align1, align2, len);
227	ret = 1;
228	break;
229	}
230	}
231	j = align2 + len + 1;
232	if (size + align2 < j)
233	j = size + align2;
234	for (; j < 512; ++j)
235	{
236	if (p2[j] != '\1')
237	{
238	error (0, 0, "Iteration %zd - garbage after, %s (%zd, %zd, %zd)",
239	n, impl->name, align1, align2, len);
240	ret = 1;
241	break;
242	}
243	}
244	j = len + 1;
245	if (size < j)
246	j = size;
247	if (memcmp (p1 + align1, p2 + align2, j))
248	{
249	error (0, 0, "Iteration %zd - different strings, %s (%zd, %zd, %zd)",
250	n, impl->name, align1, align2, len);
251	ret = 1;
252	}
253	}
254	}
255	}
256
257	int
258	test_main (void)
259	{
260	size_t i;
261
262	test_init ();
263
264	printf ("%28s", "");
265	FOR_EACH_IMPL (impl, 0)
266	printf ("\t%s", impl->name);
267	putchar ('\n');
268
269	for (i = 1; i < 8; ++i)
270	{
271	do_test (i, i, 12, 16, 16, 127);
272	do_test (i, i, 23, 16, 16, 255);
273	do_test (i, 2 * i, 28, 16, 16, 127);
274	do_test (2 * i, i, 31, 16, 16, 255);
275	do_test (8 - i, 2 * i, 1, 1 << i, 2 << i, 127);
276	do_test (2 * i, 8 - i, 17, 2 << i, 1 << i, 127);
277	do_test (8 - i, 2 * i, 0, 1 << i, 2 << i, 255);
278	do_test (2 * i, 8 - i, i, 2 << i, 1 << i, 255);
279	}
280
281	for (i = 1; i < 8; ++i)
282	{
283	do_test (0, 0, i, 4 << i, 8 << i, 127);
284	do_test (0, 0, i, 16 << i, 8 << i, 127);
285	do_test (8 - i, 2 * i, i, 4 << i, 8 << i, 127);
286	do_test (8 - i, 2 * i, i, 16 << i, 8 << i, 127);
287	}
288
289	do_random_tests ();
290	return ret;
291	}
292
293	#include "../test-skeleton.c"