about summary refs log tree commit diff
path: root/string/test-memset.c
diff options
context:
space:
mode:
Diffstat (limited to 'string/test-memset.c')
-rw-r--r--string/test-memset.c212
1 files changed, 212 insertions, 0 deletions
diff --git a/string/test-memset.c b/string/test-memset.c
new file mode 100644
index 0000000000..2847502f10
--- /dev/null
+++ b/string/test-memset.c
@@ -0,0 +1,212 @@
+/* Test and measure memset functions.
+   Copyright (C) 1999, 2002 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, write to the Free
+   Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
+   02111-1307 USA.  */
+
+#define TEST_MAIN
+#define MIN_PAGE_SIZE 131072
+#include "test-string.h"
+
+typedef char *(*proto_t) (char *, int, size_t);
+char *simple_memset (char *, int, size_t);
+char *builtin_memset (char *, int, size_t);
+
+IMPL (simple_memset, 0)
+IMPL (builtin_memset, 0)
+IMPL (memset, 1)
+
+char *
+simple_memset (char *s, int c, size_t n)
+{
+  char *r = s, *end = s + n;
+  while (r < end)
+    *r++ = c;
+  return s;
+}
+
+char *
+builtin_memset (char *s, int c, size_t n)
+{
+  return __builtin_memset (s, c, n);
+}
+
+static void
+do_one_test (impl_t *impl, char *s, int c, size_t n)
+{
+  char *res = CALL (impl, s, c, n);
+  if (res != s)
+    {
+      error (0, 0, "Wrong result in function %s %p != %p", impl->name,
+	     res, s);
+      ret = 1;
+      return;
+    }
+
+  if (HP_TIMING_AVAIL)
+    {
+      hp_timing_t start, stop, best_time = ~ (hp_timing_t) 0;
+      size_t i;
+
+      for (i = 0; i < 32; ++i)
+	{
+	  HP_TIMING_NOW (start);
+	  CALL (impl, s, 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 align, int c, size_t len)
+{
+  align &= 7;
+  if (align + len > page_size)
+    return;
+
+  if (HP_TIMING_AVAIL)
+    printf ("Length %4zd, alignment %2zd, c %2d:", len, align, c);
+
+  FOR_EACH_IMPL (impl, 0)
+    do_one_test (impl, buf1 + align, c, len);
+
+  if (HP_TIMING_AVAIL)
+    putchar ('\n');
+}
+
+static void
+do_random_tests (void)
+{
+  size_t i, j, k, n, align, len, size;
+  int c, o;
+  unsigned char *p, *res;
+
+  for (i = 0; i < 65536; ++i)
+    buf2[i] = random () & 255;
+
+  for (n = 0; n < ITERATIONS; n++)
+    {
+      if ((random () & 31) == 0)
+	size = 65536;
+      else
+	size = 512;
+      p = buf1 + page_size - size;
+      len = random () & (size - 1);
+      align = size - len - (random () & 31);
+      if (align > size)
+	align = size - len;
+      if ((random () & 7) == 0)
+	align &= ~63;
+      if ((random () & 7) == 0)
+	c = 0;
+      else
+	c = random () & 255;
+      o = random () & 255;
+      if (o == c)
+        o = (c + 1) & 255;
+      j = len + align + 128;
+      if (j > size)
+	j = size;
+      if (align >= 128)
+	k = align - 128;
+      else
+	k = 0;
+      for (i = k; i < align; ++i)
+	p[i] = o;
+      for (i = align + len; i < j; ++i)
+	p[i] = o;
+
+      FOR_EACH_IMPL (impl, 1)
+	{
+	  for (i = 0; i < len; ++i)
+	    {
+	      p[i + align] = buf2[i];
+	      if (p[i + align] == c)
+		p[i + align] = o;
+	    }
+	  res = CALL (impl, p + align, c, len);
+	  if (res != p + align)
+	    {
+	      error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %d, %zd) %p != %p",
+		     n, impl->name, align, c, len, res, p + align);
+	      ret = 1;
+	    }
+	  for (i = k; i < align; ++i)
+	    if (p[i] != o)
+	      {
+		error (0, 0, "Iteration %zd - garbage before %s (%zd, %d, %zd)",
+		       n, impl->name, align, c, len);
+		ret = 1;
+		break;
+	      }
+	  for (; i < align + len; ++i)
+	    if (p[i] != c)
+	      {
+		error (0, 0, "Iteration %zd - not cleared correctly %s (%zd, %d, %zd)",
+		       n, impl->name, align, c, len);
+		ret = 1;
+		break;
+	      }
+	  for (; i < j; ++i)
+	    if (p[i] != o)
+	      {
+		error (0, 0, "Iteration %zd - garbage after %s (%zd, %d, %zd)",
+		       n, impl->name, align, c, len);
+		ret = 1;
+		break;
+	      }
+	}
+    }
+}
+
+int
+test_main (void)
+{
+  size_t i;
+  int c;
+
+  test_init ();
+
+  printf ("%24s", "");
+  FOR_EACH_IMPL (impl, 0)
+    printf ("\t%s", impl->name);
+  putchar ('\n');
+
+  for (c = 0; c <= 65; c += 65)
+    {
+      for (i = 0; i < 18; ++i)
+	do_test (0, c, 1 << i);
+      for (i = 1; i < 32; ++i)
+	{
+	  do_test (i, c, i);
+	  if (i & (i - 1))
+	    do_test (0, c, i);
+	}
+      do_test (1, c, 14);
+      do_test (3, c, 1024);
+      do_test (4, c, 64);
+      do_test (2, c, 25);
+    }
+
+  do_random_tests ();
+  return ret;
+}
+
+#include "../test-skeleton.c"