string/test-strrchr.c

   1 /* Test and measure strrchr 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);
  25 char *simple_strrchr (const char *, int);
  26
  27 IMPL (simple_strrchr, 0)
  28 IMPL (strrchr, 1)
  29
  30 char *
  31 simple_strrchr (const char *s, int c)
  32 {
  33   const char *ret = NULL;
  34
  35   for (; *s != '\0'; ++s)
  36     if (*s == (char) c)
  37       ret = s;
  38
  39   return (char *) (c == '\0' ? s : ret);
  40 }
  41
  42 static void
  43 do_one_test (impl_t *impl, const char *s, int c, char *exp_res)
  44 {
  45   char *res = CALL (impl, s, c);
  46   if (res != exp_res)
  47     {
  48       error (0, 0, "Wrong result in function %s %p %p", impl->name,
  49              res, exp_res);
  50       ret = 1;
  51       return;
  52     }
  53
  54   if (HP_TIMING_AVAIL)
  55     {
  56       hp_timing_t start, stop, best_time = ~ (hp_timing_t) 0;
  57       size_t i;
  58
  59       for (i = 0; i < 32; ++i)
  60         {
  61           HP_TIMING_NOW (start);
  62           CALL (impl, s, c);
  63           HP_TIMING_NOW (stop);
  64           HP_TIMING_BEST (best_time, start, stop);
  65         }
  66
  67       printf ("\t%zd", (size_t) best_time);
  68     }
  69 }
  70
  71 static void
  72 do_test (size_t align, size_t pos, size_t len, int seek_char, int max_char)
  73 {
  74   size_t i;
  75   char *result;
  76
  77   align &= 7;
  78   if (align + len >= page_size)
  79     return;
  80
  81   for (i = 0; i < len; ++i)
  82     {
  83       buf1[align + i] = random () & max_char;
  84       if (!buf1[align + i])
  85         buf1[align + i] = random () & max_char;
  86       if (!buf1[align + i])
  87         buf1[align + i] = 1;
  88       if ((i > pos || pos >= len) && buf1[align + i] == seek_char)
  89         buf1[align + i] = seek_char + 10 + (random () & 15);
  90     }
  91   buf1[align + len] = 0;
  92
  93   if (pos < len)
  94     {
  95       buf1[align + pos] = seek_char;
  96       result = buf1 + align + pos;
  97     }
  98   else if (seek_char == 0)
  99     result = buf1 + align + len;
 100   else
 101     result = NULL;
 102
 103   if (HP_TIMING_AVAIL)
 104     printf ("Length %4zd, alignment %2zd:", pos, align);
 105
 106   FOR_EACH_IMPL (impl, 0)
 107     do_one_test (impl, buf1 + align, seek_char, result);
 108
 109   if (HP_TIMING_AVAIL)
 110     putchar ('\n');
 111 }
 112
 113 static void
 114 do_random_tests (void)
 115 {
 116   size_t i, j, n, align, pos, len;
 117   int seek_char;
 118   char *result;
 119   unsigned char *p = buf1 + page_size - 512;
 120
 121   for (n = 0; n < ITERATIONS; n++)
 122     {
 123       align = random () & 15;
 124       pos = random () & 511;
 125       if (pos + align >= 511)
 126         pos = 510 - align - (random () & 7);
 127       len = random () & 511;
 128       if (pos >= len)
 129         len = pos + (random () & 7);
 130       if (len + align >= 512)
 131         len = 511 - align - (random () & 7);
 132       seek_char = random () & 255;
 133       if (seek_char && pos == len)
 134         {
 135           if (pos)
 136             --pos;
 137           else
 138             ++len;
 139         }
 140       j = len + align + 64;
 141       if (j > 512)
 142         j = 512;
 143
 144       for (i = 0; i < j; i++)
 145         {
 146           if (i == pos + align)
 147             p[i] = seek_char;
 148           else if (i == len + align)
 149             p[i] = 0;
 150           else
 151             {
 152               p[i] = random () & 255;
 153               if (((i > pos + align && i < len + align) || pos > len)
 154                   && p[i] == seek_char)
 155                 p[i] = seek_char + 13;
 156               if (i < len + align && !p[i])
 157                 {
 158                   p[i] = seek_char - 13;
 159                   if (!p[i])
 160                     p[i] = 140;
 161                 }
 162             }
 163         }
 164
 165       if (pos <= len)
 166         result = p + pos + align;
 167       else if (seek_char == 0)
 168         result = p + len + align;
 169       else
 170         result = NULL;
 171
 172       FOR_EACH_IMPL (impl, 1)
 173         if (CALL (impl, p + align, seek_char) != result)
 174           {
 175             error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %d, %zd, %zd) %p != %p, p %p",
 176                    n, impl->name, align, seek_char, len, pos,
 177                    CALL (impl, p + align, seek_char), result, p);
 178             ret = 1;
 179           }
 180     }
 181 }
 182
 183 int
 184 test_main (void)
 185 {
 186   size_t i;
 187
 188   test_init ();
 189
 190   printf ("%20s", "");
 191   FOR_EACH_IMPL (impl, 0)
 192     printf ("\t%s", impl->name);
 193   putchar ('\n');
 194
 195   for (i = 1; i < 8; ++i)
 196     {
 197       do_test (0, 16 << i, 2048, 23, 127);
 198       do_test (i, 16 << i, 2048, 23, 127);
 199     }
 200
 201   for (i = 1; i < 8; ++i)
 202     {
 203       do_test (i, 64, 256, 23, 127);
 204       do_test (i, 64, 256, 23, 255);
 205     }
 206
 207   for (i = 0; i < 32; ++i)
 208     {
 209       do_test (0, i, i + 1, 23, 127);
 210       do_test (0, i, i + 1, 23, 255);
 211     }
 212
 213   for (i = 1; i < 8; ++i)
 214     {
 215       do_test (0, 16 << i, 2048, 0, 127);
 216       do_test (i, 16 << i, 2048, 0, 127);
 217     }
 218
 219   for (i = 1; i < 8; ++i)
 220     {
 221       do_test (i, 64, 256, 0, 127);
 222       do_test (i, 64, 256, 0, 255);
 223     }
 224
 225   for (i = 0; i < 32; ++i)
 226     {
 227       do_test (0, i, i + 1, 0, 127);
 228       do_test (0, i, i + 1, 0, 255);
 229     }
 230
 231   do_random_tests ();
 232   return ret;
 233 }
 234
 235 #include "../test-skeleton.c"