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

/* Test and measure strncat functions.
   Copyright (C) 2011-2014 Free Software Foundation, Inc.
   Contributed by Intel Corporation.

   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 "strncat"
#include "test-string.h"

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

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 >= page_size)
    return;
  if (align1 + n > page_size)
    return;
  align2 &= 7;
  if (align2 + len1 + len2 >= page_size)
    return;
  if (align2 + len1 + n > 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);

  FOR_EACH_IMPL (impl, 0)
    {
      s2[len2] = '\0';
      do_one_test (impl, s2, s1, n);
    }
}

static void
do_random_tests (void)
{
  size_t i, j, n, align1, align2, len1, len2, N;
  unsigned char *p1 = buf1 + page_size - 512;
  unsigned char *p2 = buf2 + page_size - 512;
  unsigned char *res;
  fprintf (stdout, "Number of iterations in random test = %zd\n",
	   ITERATIONS);
  for (n = 0; n < ITERATIONS; n++)
    {
      N = random () & 255;
      align1 = random () & 31;
      if (random () & 1)
	align2 = random () & 31;
      else
	align2 = align1 + (random () & 24);
      len1 = random () & 511;
      if (len1 + align2 > 512)
	len2 = random () & 7;
      else
	len2 = (512 - len1 - align2) * (random () & (1024 * 1024 - 1))
	  / (1024 * 1024);
      j = align1;
      if (align2 + len2 > j)
	j = align2 + len2;
      if (len1 + j >= 511)
	len1 = 510 - j - (random () & 7);
      if (len1 >= 512)
	len1 = 0;
      if (align1 + len1 < 512 - 8)
	{
	  j = 510 - align1 - len1 - (random () & 31);
	  if (j > 0 && j < 512)
	    align1 += j;
	}
      j = len1 + align1 + 64;
      if (j > 512)
	j = 512;
      for (i = 0; i < j; i++)
	{
	  if (i == len1 + align1)
	    p1[i] = 0;
	  else
	    {
	      p1[i] = random () & 255;
	      if (i >= align1 && i < len1 + align1 && !p1[i])
		p1[i] = (random () & 127) + 3;
	    }
	}
      for (i = 0; i < len2; i++)
	{
	  buf1[i] = random () & 255;
	  if (!buf1[i])
	    buf1[i] = (random () & 127) + 3;
	}
      buf1[len2] = 0;

      FOR_EACH_IMPL (impl, 1)
	{
	  memset (p2 - 64, '\1', align2 + 64);
	  memset (p2 + align2 + len2 + 1, '\1', 512 - align2 - len2 - 1);
	  memcpy (p2 + align2, buf1, len2 + 1);
	  res = (unsigned char *) CALL (impl, (char *) (p2 + align2),
					(char *) (p1 + align1), N);
	  if (res != p2 + align2)
	    {
	      error (0, 0, "Iteration %zd - wrong result in function %s "
		     "(%zd, %zd, %zd, %zd, %zd) %p != %p",
		     n, impl->name, align1, align2, len1, len2, N,
		     res, p2 + align2);
	      ret = 1;
	    }
	  for (j = 0; j < align2 + 64; ++j)
	    {
	      if (p2[j - 64] != '\1')
		{
		  error (0, 0, "Iteration %zd - garbage before dst, %s "
			 "%zd, %zd, %zd, %zd, %zd)",
			 n, impl->name, align1, align2, len1, len2, N);
		  ret = 1;
		  break;
		}
	    }
	  if (memcmp (p2 + align2, buf1, len2))
	    {
	      error (0, 0, "Iteration %zd - garbage in string before, %s "
		     "(%zd, %zd, %zd, %zd, %zd)",
		     n, impl->name, align1, align2, len1, len2, N);
	      ret = 1;
	    }

	  if ((len1 + 1) > N)
	    j = align2 + N + 1 + len2;
	  else
	    j = align2 + len1 + 1 + len2;
	  for (; j < 512; ++j)
	    {
	      if (p2[j] != '\1')
		{
		  error (0, 0, "Iteration %zd - garbage after, %s "
			 "(%zd, %zd, %zd, %zd, %zd)",
			 n, impl->name, align1, align2, len1, len2, N);
		  ret = 1;
		  break;
		}
	    }
	  if (len1 + 1 > N)
	    {
	      if (p2[align2 + N + len2] != '\0')
		{
		  error (0, 0, "Iteration %zd - there is no zero at the "
			 "end of output string, %s (%zd, %zd, %zd, %zd, %zd)",
			 n, impl->name, align1, align2, len1, len2, N);
		  ret = 1;
		}
	    }
	  if (memcmp (p1 + align1, p2 + align2 + len2,
		      (len1 + 1) > N ? N : len1 + 1))
	    {
	      error (0, 0, "Iteration %zd - different strings, %s "
		     "(%zd, %zd, %zd, %zd, %zd)",
		     n, impl->name, align1, align2, len1, len2, N);
	      ret = 1;
	    }
	}
    }
}

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, 127);
      do_test (0, 0, 4, 4, n, 127);
      do_test (4, 0, 4, 4, n, 255);
      do_test (0, 0, 8, 8, n, 127);
      do_test (0, 8, 8, 8, n, 127);

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

      for (i = 1; i < 8; ++i)
	{
	  do_test (i, 2 * i, 8 << i, 1, n, 127);
	  do_test (2 * i, i, 8 << i, 1, n, 255);
	  do_test (i, i, 8 << i, 10, n, 127);
	}
    }

  do_random_tests ();
  return ret;
}
Commit	Line	Data
6f0eec67	1	/* Test and measure strncat functions.
d4697bc9	2	Copyright (C) 2011-2014 Free Software Foundation, Inc.
6f0eec67 UD	3	Contributed by Intel Corporation.
	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
59ba27a6 PE	16	License along with the GNU C Library; if not, see
59ba27a6 PE	17	<http://www.gnu.org/licenses/>. */
6f0eec67 UD	18
6f0eec67 UD	19	#define TEST_MAIN
69f07e5f	20	#define TEST_NAME "strncat"
6f0eec67 UD	21	#include "test-string.h"
	22
	23	typedef char (proto_t) (char , const char , size_t);
	24	char stupid_strncat (char , const char *, size_t);
	25	char simple_strncat (char , const char *, size_t);
	26
	27	IMPL (stupid_strncat, 0)
	28	IMPL (strncat, 2)
	29
	30	char *
	31	stupid_strncat (char dst, const char src, size_t n)
	32	{
	33	char *ret = dst;
	34	while (*dst++ != '\0');
	35	--dst;
	36	while (n--)
	37	if ( (dst++ = src++) == '\0')
	38	return ret;
	39	*dst = '\0';
	40	return ret;
	41	}
	42
	43	static void
	44	do_one_test (impl_t impl, char dst, const char *src, size_t n)
	45	{
	46	size_t k = strlen (dst);
	47	if (CALL (impl, dst, src, n) != dst)
	48	{
	49	error (0, 0, "Wrong result in function %s %p != %p", impl->name,
	50	CALL (impl, dst, src, n), dst);
	51	ret = 1;
	52	return;
	53	}
	54
	55	size_t len = strlen (src);
	56	if (memcmp (dst + k, src, len + 1 > n ? n : len + 1) != 0)
	57	{
	58	error (0, 0, "Incorrect cancatination in function %s",
	59	impl->name);
	60	ret = 1;
	61	return;
	62	}
	63	if (n < len && dst[k + n] != '\0')
	64	{
	65	error (0, 0, "There is no zero in the end of output string in %s",
	66	impl->name);
	67	ret = 1;
	68	return;
	69	}
6f0eec67 UD	70	}
	71
	72	static void
	73	do_test (size_t align1, size_t align2, size_t len1, size_t len2,
	74	size_t n, int max_char)
	75	{
	76	size_t i;
	77	char s1, s2;
	78
	79	align1 &= 7;
	80	if (align1 + len1 >= page_size)
	81	return;
	82	if (align1 + n > page_size)
	83	return;
	84	align2 &= 7;
	85	if (align2 + len1 + len2 >= page_size)
	86	return;
	87	if (align2 + len1 + n > page_size)
	88	return;
	89	s1 = (char *) (buf1 + align1);
	90	s2 = (char *) (buf2 + align2);
	91
	92	for (i = 0; i < len1; ++i)
	93	s1[i] = 32 + 23 * i % (max_char - 32);
	94	s1[len1] = '\0';
	95
	96	for (i = 0; i < len2; i++)
	97	s2[i] = 32 + 23 * i % (max_char - 32);
	98
6f0eec67 UD	99	FOR_EACH_IMPL (impl, 0)
	100	{
	101	s2[len2] = '\0';
	102	do_one_test (impl, s2, s1, n);
	103	}
6f0eec67 UD	104	}
	105
	106	static void
	107	do_random_tests (void)
	108	{
	109	size_t i, j, n, align1, align2, len1, len2, N;
	110	unsigned char *p1 = buf1 + page_size - 512;
	111	unsigned char *p2 = buf2 + page_size - 512;
	112	unsigned char *res;
	113	fprintf (stdout, "Number of iterations in random test = %zd\n",
	114	ITERATIONS);
	115	for (n = 0; n < ITERATIONS; n++)
	116	{
	117	N = random () & 255;
	118	align1 = random () & 31;
	119	if (random () & 1)
	120	align2 = random () & 31;
	121	else
	122	align2 = align1 + (random () & 24);
	123	len1 = random () & 511;
	124	if (len1 + align2 > 512)
	125	len2 = random () & 7;
	126	else
	127	len2 = (512 - len1 - align2) * (random () & (1024 * 1024 - 1))
	128	/ (1024 * 1024);
	129	j = align1;
	130	if (align2 + len2 > j)
	131	j = align2 + len2;
	132	if (len1 + j >= 511)
	133	len1 = 510 - j - (random () & 7);
	134	if (len1 >= 512)
	135	len1 = 0;
	136	if (align1 + len1 < 512 - 8)
	137	{
	138	j = 510 - align1 - len1 - (random () & 31);
	139	if (j > 0 && j < 512)
	140	align1 += j;
	141	}
	142	j = len1 + align1 + 64;
	143	if (j > 512)
	144	j = 512;
	145	for (i = 0; i < j; i++)
	146	{
	147	if (i == len1 + align1)
	148	p1[i] = 0;
	149	else
	150	{
	151	p1[i] = random () & 255;
	152	if (i >= align1 && i < len1 + align1 && !p1[i])
	153	p1[i] = (random () & 127) + 3;
	154	}
	155	}
	156	for (i = 0; i < len2; i++)
	157	{
	158	buf1[i] = random () & 255;
	159	if (!buf1[i])
	160	buf1[i] = (random () & 127) + 3;
	161	}
	162	buf1[len2] = 0;
	163
	164	FOR_EACH_IMPL (impl, 1)
	165	{
	166	memset (p2 - 64, '\1', align2 + 64);
	167	memset (p2 + align2 + len2 + 1, '\1', 512 - align2 - len2 - 1);
168	memcpy (p2 + align2, buf1, len2 + 1);
169	res = (unsigned char ) CALL (impl, (char ) (p2 + align2),
170	(char *) (p1 + align1), N);
171	if (res != p2 + align2)
172	{
173	error (0, 0, "Iteration %zd - wrong result in function %s "
174	"(%zd, %zd, %zd, %zd, %zd) %p != %p",
175	n, impl->name, align1, align2, len1, len2, N,
176	res, p2 + align2);
177	ret = 1;
178	}
179	for (j = 0; j < align2 + 64; ++j)
180	{
181	if (p2[j - 64] != '\1')
182	{
183	error (0, 0, "Iteration %zd - garbage before dst, %s "
184	"%zd, %zd, %zd, %zd, %zd)",
185	n, impl->name, align1, align2, len1, len2, N);
186	ret = 1;
187	break;
188	}
189	}
190	if (memcmp (p2 + align2, buf1, len2))
191	{
192	error (0, 0, "Iteration %zd - garbage in string before, %s "
193	"(%zd, %zd, %zd, %zd, %zd)",
194	n, impl->name, align1, align2, len1, len2, N);
195	ret = 1;
196	}
197
198	if ((len1 + 1) > N)
199	j = align2 + N + 1 + len2;
200	else
201	j = align2 + len1 + 1 + len2;
202	for (; j < 512; ++j)
203	{
204	if (p2[j] != '\1')
205	{
206	error (0, 0, "Iteration %zd - garbage after, %s "
207	"(%zd, %zd, %zd, %zd, %zd)",
208	n, impl->name, align1, align2, len1, len2, N);
209	ret = 1;
210	break;
211	}
212	}
213	if (len1 + 1 > N)
214	{
215	if (p2[align2 + N + len2] != '\0')
216	{
217	error (0, 0, "Iteration %zd - there is no zero at the "
218	"end of output string, %s (%zd, %zd, %zd, %zd, %zd)",
219	n, impl->name, align1, align2, len1, len2, N);
220	ret = 1;
221	}
222	}
223	if (memcmp (p1 + align1, p2 + align2 + len2,
224	(len1 + 1) > N ? N : len1 + 1))
225	{
226	error (0, 0, "Iteration %zd - different strings, %s "
227	"(%zd, %zd, %zd, %zd, %zd)",
228	n, impl->name, align1, align2, len1, len2, N);
229	ret = 1;
230	}
231	}
232	}
233	}
234
235	int
236	main (void)
237	{
238	size_t i, n;
239
240	test_init ();
241
242	printf ("%28s", "");
243	FOR_EACH_IMPL (impl, 0)
244	printf ("\t%s", impl->name);
245	putchar ('\n');
246
247	for (n = 2; n <= 2048; n*=4)
248	{
249	do_test (0, 2, 2, 2, n, 127);
250	do_test (0, 0, 4, 4, n, 127);
251	do_test (4, 0, 4, 4, n, 255);
252	do_test (0, 0, 8, 8, n, 127);
253	do_test (0, 8, 8, 8, n, 127);
254
255	for (i = 1; i < 8; ++i)
256	{
257	do_test (0, 0, 8 << i, 8 << i, n, 127);
258	do_test (8 - i, 2 * i, 8 << i, 8 << i, n, 127);
259	do_test (0, 0, 8 << i, 2 << i, n, 127);
260	do_test (8 - i, 2 * i, 8 << i, 2 << i, n, 127);
261	}
262
263	for (i = 1; i < 8; ++i)
264	{
265	do_test (i, 2 * i, 8 << i, 1, n, 127);
266	do_test (2 * i, i, 8 << i, 1, n, 255);
267	do_test (i, i, 8 << i, 10, n, 127);
268	}
269	}
270
271	do_random_tests ();
272	return ret;
273	}