string/test-memchr.c

   1 /* Test and measure memchr functions.
   2    Copyright (C) 1999, 2002 Free Software Foundation, Inc.
   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
  17    License along with the GNU C Library; if not, write to the Free
  18    Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  19    02111-1307 USA.  */
  20
  21 #define TEST_MAIN
  22 #include "test-string.h"
  23
  24 typedef char *(*proto_t) (const char *, int, size_t);
  25 char *simple_memchr (const char *, int, size_t);
  26
  27 IMPL (simple_memchr, 0)
  28 IMPL (memchr, 1)
  29
  30 char *
  31 simple_memchr (const char *s, int c, size_t n)
  32 {
  33   while (n--)
  34     if (*s++ == (char) c)
  35       return (char *) s - 1;
  36   return NULL;
  37 }
  38
  39 static void
  40 do_one_test (impl_t *impl, const char *s, int c, size_t n, char *exp_res)
  41 {
  42   char *res = CALL (impl, s, c, n);
  43   if (res != exp_res)
  44     {
  45       error (0, 0, "Wrong result in function %s %p %p", impl->name,
  46              res, exp_res);
  47       ret = 1;
  48       return;
  49     }
  50
  51   if (HP_TIMING_AVAIL)
  52     {
  53       hp_timing_t start, stop, best_time = ~ (hp_timing_t) 0;
  54       size_t i;
  55
  56       for (i = 0; i < 32; ++i)
  57         {
  58           HP_TIMING_NOW (start);
  59           CALL (impl, s, c, n);
  60           HP_TIMING_NOW (stop);
  61           HP_TIMING_BEST (best_time, start, stop);
  62         }
  63
  64       printf ("\t%zd", (size_t) best_time);
  65     }
  66 }
  67
  68 static void
  69 do_test (size_t align, size_t pos, size_t len, int seek_char)
  70 {
  71   size_t i;
  72   char *result;
  73
  74   align &= 7;
  75   if (align + len >= page_size)
  76     return;
  77
  78   for (i = 0; i < len; ++i)
  79     {
  80       buf1[align + i] = 1 + 23 * i % 127;
  81       if (buf1[align + i] == seek_char)
  82         buf1[align + i] = seek_char + 1;
  83     }
  84   buf1[align + len] = 0;
  85
  86   if (pos < len)
  87     {
  88       buf1[align + pos] = seek_char;
  89       buf1[align + len] = -seek_char;
  90       result = buf1 + align + pos;
  91     }
  92   else
  93     {
  94       result = NULL;
  95       buf1[align + len] = seek_char;
  96     }
  97
  98   if (HP_TIMING_AVAIL)
  99     printf ("Length %4zd, alignment %2zd:", pos, align);
 100
 101   FOR_EACH_IMPL (impl, 0)
 102     do_one_test (impl, buf1 + align, seek_char, len, result);
 103
 104   if (HP_TIMING_AVAIL)
 105     putchar ('\n');
 106 }
 107
 108 static void
 109 do_random_tests (void)
 110 {
 111   size_t i, j, n, align, pos, len;
 112   int seek_char;
 113   char *result;
 114   unsigned char *p = buf1 + page_size - 512;
 115
 116   for (n = 0; n < ITERATIONS; n++)
 117     {
 118       align = random () & 15;
 119       pos = random () & 511;
 120       if (pos + align >= 512)
 121         pos = 511 - align - (random () & 7);
 122       len = random () & 511;
 123       if (pos >= len)
 124         len = pos + (random () & 7);
 125       if (len + align >= 512)
 126         len = 512 - align - (random () & 7);
 127       seek_char = random () & 255;
 128       j = len + align + 64;
 129       if (j > 512)
 130         j = 512;
 131
 132       for (i = 0; i < j; i++)
 133         {
 134           if (i == pos + align)
 135             p[i] = seek_char;
 136           else
 137             {
 138               p[i] = random () & 255;
 139               if (i < pos + align && p[i] == seek_char)
 140                 p[i] = seek_char + 13;
 141             }
 142         }
 143
 144       if (pos < len)
 145         result = p + pos + align;
 146       else
 147         result = NULL;
 148
 149       FOR_EACH_IMPL (impl, 1)
 150         if (CALL (impl, p + align, seek_char, len) != result)
 151           {
 152             error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %d, %zd, %zd) %p != %p, p %p",
 153                    n, impl->name, align, seek_char, len, pos,
 154                    CALL (impl, p + align, seek_char, len), result, p);
 155             ret = 1;
 156           }
 157     }
 158 }
 159
 160 int
 161 test_main (void)
 162 {
 163   size_t i;
 164
 165   test_init ();
 166
 167   printf ("%20s", "");
 168   FOR_EACH_IMPL (impl, 0)
 169     printf ("\t%s", impl->name);
 170   putchar ('\n');
 171
 172   for (i = 1; i < 8; ++i)
 173     {
 174       do_test (0, 16 << i, 2048, 23);
 175       do_test (i, 64, 256, 23);
 176       do_test (0, 16 << i, 2048, 0);
 177       do_test (i, 64, 256, 0);
 178     }
 179   for (i = 1; i < 32; ++i)
 180     {
 181       do_test (0, i, i + 1, 23);
 182       do_test (0, i, i + 1, 0);
 183     }
 184
 185   do_random_tests ();
 186   return ret;
 187 }
 188
 189 #include "../test-skeleton.c"