string/test-strncasecmp.c

   1 /* Test and measure strncasecmp functions.
   2    Copyright (C) 1999, 2002, 2003, 2005, 2010 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 #include <ctype.h>
  22 #define TEST_MAIN
  23 #include "test-string.h"
  24
  25 typedef int (*proto_t) (const char *, const char *, size_t);
  26 static int simple_strncasecmp (const char *, const char *, size_t);
  27 static int stupid_strncasecmp (const char *, const char *, size_t);
  28
  29 IMPL (stupid_strncasecmp, 0)
  30 IMPL (simple_strncasecmp, 0)
  31 IMPL (strncasecmp, 1)
  32
  33 static int
  34 simple_strncasecmp (const char *s1, const char *s2, size_t n)
  35 {
  36   int ret;
  37
  38   if (n == 0)
  39     return 0;
  40
  41   while ((ret = ((unsigned char) tolower (*s1)
  42                  - (unsigned char) tolower (*s2))) == 0
  43          && *s1++)
  44     {
  45       if (--n == 0)
  46         return 0;
  47       ++s2;
  48     }
  49   return ret;
  50 }
  51
  52 static int
  53 stupid_strncasecmp (const char *s1, const char *s2, size_t max)
  54 {
  55   size_t ns1 = strlen (s1) + 1;
  56   size_t ns2 = strlen (s2) + 1;
  57   size_t n = ns1 < ns2 ? ns1 : ns2;
  58   if (n > max)
  59     n = max;
  60   int ret = 0;
  61
  62   while (n--)
  63     {
  64       if ((ret = ((unsigned char) tolower (*s1)
  65                   - (unsigned char) tolower (*s2))) != 0)
  66         break;
  67       ++s1;
  68       ++s2;
  69     }
  70   return ret;
  71 }
  72
  73 static void
  74 do_one_test (impl_t *impl, const char *s1, const char *s2, size_t n,
  75              int exp_result)
  76 {
  77   int result = CALL (impl, s1, s2, n);
  78   if ((exp_result == 0 && result != 0)
  79       || (exp_result < 0 && result >= 0)
  80       || (exp_result > 0 && result <= 0))
  81     {
  82       error (0, 0, "Wrong result in function %s %d %d", impl->name,
  83              result, exp_result);
  84       ret = 1;
  85       return;
  86     }
  87
  88   if (HP_TIMING_AVAIL)
  89     {
  90       hp_timing_t start __attribute ((unused));
  91       hp_timing_t stop __attribute ((unused));
  92       hp_timing_t best_time = ~ (hp_timing_t) 0;
  93       size_t i;
  94
  95       for (i = 0; i < 32; ++i)
  96         {
  97           HP_TIMING_NOW (start);
  98           CALL (impl, s1, s2, n);
  99           HP_TIMING_NOW (stop);
 100           HP_TIMING_BEST (best_time, start, stop);
 101         }
 102
 103       printf ("\t%zd", (size_t) best_time);
 104     }
 105 }
 106
 107 static void
 108 do_test (size_t align1, size_t align2, size_t n, size_t len, int max_char,
 109          int exp_result)
 110 {
 111   size_t i;
 112   char *s1, *s2;
 113
 114   if (len == 0)
 115     return;
 116
 117   align1 &= 7;
 118   if (align1 + len + 1 >= page_size)
 119     return;
 120
 121   align2 &= 7;
 122   if (align2 + len + 1 >= page_size)
 123     return;
 124
 125   s1 = (char *) (buf1 + align1);
 126   s2 = (char *) (buf2 + align2);
 127
 128   for (i = 0; i < len; i++)
 129     {
 130       s1[i] = toupper (1 + 23 * i % max_char);
 131       s2[i] = tolower (s1[i]);
 132     }
 133
 134   s1[len] = s2[len] = 0;
 135   s1[len + 1] = 23;
 136   s2[len + 1] = 24 + exp_result;
 137   if ((s2[len - 1] == 'z' && exp_result == -1)
 138       || (s2[len - 1] == 'a' && exp_result == 1))
 139     s1[len - 1] += exp_result;
 140   else
 141     s2[len - 1] -= exp_result;
 142
 143   if (HP_TIMING_AVAIL)
 144     printf ("Length %4zd, alignment %2zd/%2zd:", len, align1, align2);
 145
 146   FOR_EACH_IMPL (impl, 0)
 147     do_one_test (impl, s1, s2, n, exp_result);
 148
 149   if (HP_TIMING_AVAIL)
 150     putchar ('\n');
 151 }
 152
 153 static void
 154 do_random_tests (void)
 155 {
 156   size_t i, j, n, align1, align2, pos, len1, len2;
 157   int result;
 158   long r;
 159   unsigned char *p1 = buf1 + page_size - 512;
 160   unsigned char *p2 = buf2 + page_size - 512;
 161
 162   for (n = 0; n < ITERATIONS; n++)
 163     {
 164       align1 = random () & 31;
 165       if (random () & 1)
 166         align2 = random () & 31;
 167       else
 168         align2 = align1 + (random () & 24);
 169       pos = random () & 511;
 170       j = align1 > align2 ? align1 : align2;
 171       if (pos + j >= 511)
 172         pos = 510 - j - (random () & 7);
 173       len1 = random () & 511;
 174       if (pos >= len1 && (random () & 1))
 175         len1 = pos + (random () & 7);
 176       if (len1 + j >= 512)
 177         len1 = 511 - j - (random () & 7);
 178       if (pos >= len1)
 179         len2 = len1;
 180       else
 181         len2 = len1 + (len1 != 511 - j ? random () % (511 - j - len1) : 0);
 182       j = (pos > len2 ? pos : len2) + align1 + 64;
 183       if (j > 512)
 184         j = 512;
 185       for (i = 0; i < j; ++i)
 186         {
 187           p1[i] = tolower (random () & 255);
 188           if (i < len1 + align1 && !p1[i])
 189             {
 190               p1[i] = tolower (random () & 255);
 191               if (!p1[i])
 192                 p1[i] = tolower (1 + (random () & 127));
 193             }
 194         }
 195       for (i = 0; i < j; ++i)
 196         {
 197           p2[i] = toupper (random () & 255);
 198           if (i < len2 + align2 && !p2[i])
 199             {
 200               p2[i] = toupper (random () & 255);
 201               if (!p2[i])
 202                 toupper (p2[i] = 1 + (random () & 127));
 203             }
 204         }
 205
 206       result = 0;
 207       memcpy (p2 + align2, p1 + align1, pos);
 208       if (pos < len1)
 209         {
 210           if (tolower (p2[align2 + pos]) == p1[align1 + pos])
 211             {
 212               p2[align2 + pos] = toupper (random () & 255);
 213               if (tolower (p2[align2 + pos]) == p1[align1 + pos])
 214                 p2[align2 + pos] = toupper (p1[align1 + pos]
 215                                             + 3 + (random () & 127));
 216             }
 217
 218           if (p1[align1 + pos] < tolower (p2[align2 + pos]))
 219             result = -1;
 220           else
 221             result = 1;
 222         }
 223       p1[len1 + align1] = 0;
 224       p2[len2 + align2] = 0;
 225
 226       FOR_EACH_IMPL (impl, 1)
 227         {
 228           r = CALL (impl, (char *) (p1 + align1), (char *) (p2 + align2),
 229                     pos + 1 + (random () & 255));
 230           /* Test whether on 64-bit architectures where ABI requires
 231              callee to promote has the promotion been done.  */
 232           asm ("" : "=g" (r) : "0" (r));
 233           if ((r == 0 && result)
 234               || (r < 0 && result >= 0)
 235               || (r > 0 && result <= 0))
 236             {
 237               error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %zd, %zd, %zd, %zd) %ld != %d, p1 %p p2 %p",
 238                      n, impl->name, align1, align2, len1, len2, pos, r, result, p1, p2);
 239               ret = 1;
 240             }
 241         }
 242     }
 243 }
 244
 245 int
 246 test_main (void)
 247 {
 248   size_t i;
 249
 250   test_init ();
 251
 252   printf ("%23s", "");
 253   FOR_EACH_IMPL (impl, 0)
 254     printf ("\t%s", impl->name);
 255   putchar ('\n');
 256
 257   for (i = 1; i < 16; ++i)
 258     {
 259       do_test (i, i, i - 1, i, 127, 0);
 260
 261       do_test (i, i, i, i, 127, 0);
 262       do_test (i, i, i, i, 127, 1);
 263       do_test (i, i, i, i, 127, -1);
 264
 265       do_test (i, i, i + 1, i, 127, 0);
 266       do_test (i, i, i + 1, i, 127, 1);
 267       do_test (i, i, i + 1, i, 127, -1);
 268     }
 269
 270   for (i = 1; i < 10; ++i)
 271     {
 272       do_test (0, 0, (2 << i) - 1, 2 << i, 127, 0);
 273       do_test (0, 0, 2 << i, 2 << i, 254, 0);
 274       do_test (0, 0, (2 << i) + 1, 2 << i, 127, 0);
 275
 276       do_test (0, 0, (2 << i) + 1, 2 << i, 254, 0);
 277
 278       do_test (0, 0, 2 << i, 2 << i, 127, 1);
 279       do_test (0, 0, (2 << i) + 10, 2 << i, 127, 1);
 280
 281       do_test (0, 0, 2 << i, 2 << i, 254, 1);
 282       do_test (0, 0, (2 << i) + 10, 2 << i, 254, 1);
 283
 284       do_test (0, 0, 2 << i, 2 << i, 127, -1);
 285       do_test (0, 0, (2 << i) + 10, 2 << i, 127, -1);
 286
 287       do_test (0, 0, 2 << i, 2 << i, 254, -1);
 288       do_test (0, 0, (2 << i) + 10, 2 << i, 254, -1);
 289     }
 290
 291   for (i = 1; i < 8; ++i)
 292     {
 293       do_test (i, 2 * i, (8 << i) - 1, 8 << i, 127, 0);
 294       do_test (i, 2 * i, 8 << i, 8 << i, 127, 0);
 295       do_test (i, 2 * i, (8 << i) + 100, 8 << i, 127, 0);
 296
 297       do_test (2 * i, i, (8 << i) - 1, 8 << i, 254, 0);
 298       do_test (2 * i, i, 8 << i, 8 << i, 254, 0);
 299       do_test (2 * i, i, (8 << i) + 100, 8 << i, 254, 0);
 300
 301       do_test (i, 2 * i, 8 << i, 8 << i, 127, 1);
 302       do_test (i, 2 * i, (8 << i) + 100, 8 << i, 127, 1);
 303
 304       do_test (2 * i, i, 8 << i, 8 << i, 254, 1);
 305       do_test (2 * i, i, (8 << i) + 100, 8 << i, 254, 1);
 306
 307       do_test (i, 2 * i, 8 << i, 8 << i, 127, -1);
 308       do_test (i, 2 * i, (8 << i) + 100, 8 << i, 127, -1);
 309
 310       do_test (2 * i, i, 8 << i, 8 << i, 254, -1);
 311       do_test (2 * i, i, (8 << i) + 100, 8 << i, 254, -1);
 312     }
 313
 314   do_random_tests ();
 315   return ret;
 316 }
 317
 318 #include "../test-skeleton.c"