string/test-strcmp.c

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