string/test-memcmp.c

   1 /* Test and measure memcmp functions.
   2    Copyright (C) 1999, 2002, 2003, 2005, 2011 Free Software Foundation, Inc.
   3    This file is part of the GNU C Library.
   4    Written by Jakub Jelinek <jakub@redhat.com>, 1999.
   5    Added wmemcmp support by Liubov Dmitrieva <liubov.dmitrieva@gmail.com>, 2011.
   6
   7    The GNU C Library is free software; you can redistribute it and/or
   8    modify it under the terms of the GNU Lesser General Public
   9    License as published by the Free Software Foundation; either
  10    version 2.1 of the License, or (at your option) any later version.
  11
  12    The GNU C Library is distributed in the hope that it will be useful,
  13    but WITHOUT ANY WARRANTY; without even the implied warranty of
  14    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  15    Lesser General Public License for more details.
  16
  17    You should have received a copy of the GNU Lesser General Public
  18    License along with the GNU C Library; if not, see
  19    <http://www.gnu.org/licenses/>.  */
  20
  21 #define TEST_MAIN
  22 #include "test-string.h"
  23 #ifdef WIDE
  24 # include <inttypes.h>
  25 # include <wchar.h>
  26
  27 # define MEMCMP wmemcmp
  28 # define MEMCPY wmemcpy
  29 # define SIMPLE_MEMCMP simple_wmemcmp
  30 # define CHAR wchar_t
  31 # define UCHAR wchar_t
  32 # define CHARBYTES 4
  33 # define CHAR__MIN WCHAR_MIN
  34 # define CHAR__MAX WCHAR_MAX
  35 int
  36 simple_wmemcmp (const wchar_t *s1, const wchar_t *s2, size_t n)
  37 {
  38   int ret = 0;
  39   /* Warning!
  40         wmemcmp has to use SIGNED comparison for elements.
  41         memcmp has to use UNSIGNED comparison for elemnts.
  42   */
  43   while (n-- && (ret = *s1 < *s2 ? -1 : *s1 == *s2 ? 0 : 1) == 0) {s1++; s2++;}
  44   return ret;
  45 }
  46 #else
  47 # define MEMCMP memcmp
  48 # define MEMCPY memcpy
  49 # define SIMPLE_MEMCMP simple_memcmp
  50 # define CHAR char
  51 # define MAX_CHAR 255
  52 # define UCHAR unsigned char
  53 # define CHARBYTES 1
  54 # define CHAR__MIN CHAR_MIN
  55 # define CHAR__MAX CHAR_MAX
  56
  57 int
  58 simple_memcmp (const char *s1, const char *s2, size_t n)
  59 {
  60   int ret = 0;
  61
  62   while (n-- && (ret = *(unsigned char *) s1++ - *(unsigned char *) s2++) == 0);
  63   return ret;
  64 }
  65 #endif
  66
  67 typedef int (*proto_t) (const CHAR *, const CHAR *, size_t);
  68
  69 IMPL (SIMPLE_MEMCMP, 0)
  70 IMPL (MEMCMP, 1)
  71
  72 static int
  73 check_result (impl_t *impl, const CHAR *s1, const CHAR *s2, size_t len,
  74               int exp_result)
  75 {
  76   int result = CALL (impl, s1, s2, len);
  77   if ((exp_result == 0 && result != 0)
  78       || (exp_result < 0 && result >= 0)
  79       || (exp_result > 0 && result <= 0))
  80     {
  81       error (0, 0, "Wrong result in function %s %d %d", impl->name,
  82              result, exp_result);
  83       ret = 1;
  84       return -1;
  85     }
  86
  87   return 0;
  88 }
  89
  90 static void
  91 do_one_test (impl_t *impl, const CHAR *s1, const CHAR *s2, size_t len,
  92              int exp_result)
  93 {
  94   if (check_result (impl, s1, s2, len, exp_result) < 0)
  95     return;
  96
  97   if (HP_TIMING_AVAIL)
  98     {
  99       hp_timing_t start __attribute ((unused));
 100       hp_timing_t stop __attribute ((unused));
 101       hp_timing_t best_time = ~ (hp_timing_t) 0;
 102       size_t i;
 103
 104       for (i = 0; i < 32; ++i)
 105         {
 106           HP_TIMING_NOW (start);
 107           CALL (impl, s1, s2, len);
 108           HP_TIMING_NOW (stop);
 109           HP_TIMING_BEST (best_time, start, stop);
 110         }
 111
 112       printf ("\t%zd", (size_t) best_time);
 113     }
 114 }
 115
 116 static void
 117 do_test (size_t align1, size_t align2, size_t len, int exp_result)
 118 {
 119   size_t i;
 120   CHAR *s1, *s2;
 121
 122   if (len == 0)
 123     return;
 124
 125   align1 &= 63;
 126   if (align1 + (len + 1) * CHARBYTES >= page_size)
 127     return;
 128
 129   align2 &= 63;
 130   if (align2 + (len + 1) * CHARBYTES >= page_size)
 131     return;
 132
 133   s1 = (CHAR *) (buf1 + align1);
 134   s2 = (CHAR *) (buf2 + align2);
 135
 136   for (i = 0; i < len; i++)
 137     s1[i] = s2[i] = 1 + (23 << ((CHARBYTES - 1) * 8)) * i % CHAR__MAX;
 138
 139   s1[len] = align1;
 140   s2[len] = align2;
 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, len, 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, len;
 157   int result;
 158   long r;
 159   UCHAR *p1 =  (UCHAR *) (buf1 + page_size - 512 * CHARBYTES);
 160   UCHAR *p2 =  (UCHAR *) (buf2 + page_size - 512 * CHARBYTES);
 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;
 171       if (align2 > j)
 172         j = align2;
 173       if (pos + j >= 512)
 174         pos = 511 - j - (random () & 7);
 175       len = random () & 511;
 176       if (len + j >= 512)
 177         len = 511 - j - (random () & 7);
 178       j = len + align1 + 64;
 179       if (j > 512) j = 512;
 180       for (i = 0; i < j; ++i)
 181         p1[i] = random () & 255;
 182       for (i = 0; i < j; ++i)
 183         p2[i] = random () & 255;
 184
 185       result = 0;
 186       if (pos >= len)
 187         MEMCPY ((CHAR *) p2 + align2, (const CHAR *) p1 + align1, len);
 188       else
 189         {
 190           MEMCPY ((CHAR *) p2 + align2, (const CHAR *) p1 + align1, pos);
 191           if (p2[align2 + pos] == p1[align1 + pos])
 192             {
 193               p2[align2 + pos] = random () & 255;
 194               if (p2[align2 + pos] == p1[align1 + pos])
 195                 p2[align2 + pos] = p1[align1 + pos] + 3 + (random () & 127);
 196             }
 197
 198           if (p1[align1 + pos] < p2[align2 + pos])
 199             result = -1;
 200           else
 201             result = 1;
 202         }
 203
 204       FOR_EACH_IMPL (impl, 1)
 205         {
 206           r = CALL (impl, (CHAR *) p1 + align1, (const CHAR *) p2 + align2,
 207                     len);
 208           if ((r == 0 && result)
 209               || (r < 0 && result >= 0)
 210               || (r > 0 && result <= 0))
 211             {
 212               error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %zd, %zd, %zd) %ld != %d, p1 %p p2 %p",
 213                      n, impl->name, align1 * CHARBYTES & 63,  align2 * CHARBYTES & 63, len, pos, r, result, p1, p2);
 214               ret = 1;
 215             }
 216         }
 217     }
 218 }
 219
 220 static void
 221 check1 (void)
 222 {
 223   CHAR s1[116], s2[116];
 224   int n, exp_result;
 225
 226   s1[0] = -108;
 227   s2[0] = -108;
 228   s1[1] = 99;
 229   s2[1] = 99;
 230   s1[2] = -113;
 231   s2[2] = -113;
 232   s1[3] = 1;
 233   s2[3] = 1;
 234   s1[4] = 116;
 235   s2[4] = 116;
 236   s1[5] = 99;
 237   s2[5] = 99;
 238   s1[6] = -113;
 239   s2[6] = -113;
 240   s1[7] = 1;
 241   s2[7] = 1;
 242   s1[8] = 84;
 243   s2[8] = 84;
 244   s1[9] = 99;
 245   s2[9] = 99;
 246   s1[10] = -113;
 247   s2[10] = -113;
 248   s1[11] = 1;
 249   s2[11] = 1;
 250   s1[12] = 52;
 251   s2[12] = 52;
 252   s1[13] = 99;
 253   s2[13] = 99;
 254   s1[14] = -113;
 255   s2[14] = -113;
 256   s1[15] = 1;
 257   s2[15] = 1;
 258   s1[16] = -76;
 259   s2[16] = -76;
 260   s1[17] = -14;
 261   s2[17] = -14;
 262   s1[18] = -109;
 263   s2[18] = -109;
 264   s1[19] = 1;
 265   s2[19] = 1;
 266   s1[20] = -108;
 267   s2[20] = -108;
 268   s1[21] = -14;
 269   s2[21] = -14;
 270   s1[22] = -109;
 271   s2[22] = -109;
 272   s1[23] = 1;
 273   s2[23] = 1;
 274   s1[24] = 84;
 275   s2[24] = 84;
 276   s1[25] = -15;
 277   s2[25] = -15;
 278   s1[26] = -109;
 279   s2[26] = -109;
 280   s1[27] = 1;
 281   s2[27] = 1;
 282   s1[28] = 52;
 283   s2[28] = 52;
 284   s1[29] = -15;
 285   s2[29] = -15;
 286   s1[30] = -109;
 287   s2[30] = -109;
 288   s1[31] = 1;
 289   s2[31] = 1;
 290   s1[32] = 20;
 291   s2[32] = 20;
 292   s1[33] = -15;
 293   s2[33] = -15;
 294   s1[34] = -109;
 295   s2[34] = -109;
 296   s1[35] = 1;
 297   s2[35] = 1;
 298   s1[36] = 20;
 299   s2[36] = 20;
 300   s1[37] = -14;
 301   s2[37] = -14;
 302   s1[38] = -109;
 303   s2[38] = -109;
 304   s1[39] = 1;
 305   s2[39] = 1;
 306   s1[40] = 52;
 307   s2[40] = 52;
 308   s1[41] = -14;
 309   s2[41] = -14;
 310   s1[42] = -109;
 311   s2[42] = -109;
 312   s1[43] = 1;
 313   s2[43] = 1;
 314   s1[44] = 84;
 315   s2[44] = 84;
 316   s1[45] = -14;
 317   s2[45] = -14;
 318   s1[46] = -109;
 319   s2[46] = -109;
 320   s1[47] = 1;
 321   s2[47] = 1;
 322   s1[48] = 116;
 323   s2[48] = 116;
 324   s1[49] = -14;
 325   s2[49] = -14;
 326   s1[50] = -109;
 327   s2[50] = -109;
 328   s1[51] = 1;
 329   s2[51] = 1;
 330   s1[52] = 116;
 331   s2[52] = 116;
 332   s1[53] = -15;
 333   s2[53] = -15;
 334   s1[54] = -109;
 335   s2[54] = -109;
 336   s1[55] = 1;
 337   s2[55] = 1;
 338   s1[56] = -44;
 339   s2[56] = -44;
 340   s1[57] = -14;
 341   s2[57] = -14;
 342   s1[58] = -109;
 343   s2[58] = -109;
 344   s1[59] = 1;
 345   s2[59] = 1;
 346   s1[60] = -108;
 347   s2[60] = -108;
 348   s1[61] = -15;
 349   s2[61] = -15;
 350   s1[62] = -109;
 351   s2[62] = -109;
 352   s1[63] = 1;
 353   s2[63] = 1;
 354   s1[64] = -76;
 355   s2[64] = -76;
 356   s1[65] = -15;
 357   s2[65] = -15;
 358   s1[66] = -109;
 359   s2[66] = -109;
 360   s1[67] = 1;
 361   s2[67] = 1;
 362   s1[68] = -44;
 363   s2[68] = -44;
 364   s1[69] = -15;
 365   s2[69] = -15;
 366   s1[70] = -109;
 367   s2[70] = -109;
 368   s1[71] = 1;
 369   s2[71] = 1;
 370   s1[72] = -12;
 371   s2[72] = -12;
 372   s1[73] = -15;
 373   s2[73] = -15;
 374   s1[74] = -109;
 375   s2[74] = -109;
 376   s1[75] = 1;
 377   s2[75] = 1;
 378   s1[76] = -12;
 379   s2[76] = -12;
 380   s1[77] = -14;
 381   s2[77] = -14;
 382   s1[78] = -109;
 383   s2[78] = -109;
 384   s1[79] = 1;
 385   s2[79] = 1;
 386   s1[80] = 20;
 387   s2[80] = -68;
 388   s1[81] = -12;
 389   s2[81] = 64;
 390   s1[82] = -109;
 391   s2[82] = -106;
 392   s1[83] = 1;
 393   s2[83] = 1;
 394   s1[84] = -12;
 395   s2[84] = -12;
 396   s1[85] = -13;
 397   s2[85] = -13;
 398   s1[86] = -109;
 399   s2[86] = -109;
 400   s1[87] = 1;
 401   s2[87] = 1;
 402   s1[88] = -44;
 403   s2[88] = -44;
 404   s1[89] = -13;
 405   s2[89] = -13;
 406   s1[90] = -109;
 407   s2[90] = -109;
 408   s1[91] = 1;
 409   s2[91] = 1;
 410   s1[92] = -76;
 411   s2[92] = -76;
 412   s1[93] = -13;
 413   s2[93] = -13;
 414   s1[94] = -109;
 415   s2[94] = -109;
 416   s1[95] = 1;
 417   s2[95] = 1;
 418   s1[96] = -108;
 419   s2[96] = -108;
 420   s1[97] = -13;
 421   s2[97] = -13;
 422   s1[98] = -109;
 423   s2[98] = -109;
 424   s1[99] = 1;
 425   s2[99] = 1;
 426   s1[100] = 116;
 427   s2[100] = 116;
 428   s1[101] = CHAR__MIN;
 429   s2[101] = CHAR__MAX;
 430   s1[102] = -109;
 431   s2[102] = -109;
 432   s1[103] = 1;
 433   s2[103] = 1;
 434   s1[104] = 84;
 435   s2[104] = 84;
 436   s1[105] = -13;
 437   s2[105] = -13;
 438   s1[106] = -109;
 439   s2[106] = -109;
 440   s1[107] = 1;
 441   s2[107] = 1;
 442   s1[108] = 52;
 443   s2[108] = 52;
 444   s1[109] = -13;
 445   s2[109] = -13;
 446   s1[110] = -109;
 447   s2[110] = -109;
 448   s1[111] = 1;
 449   s2[111] = 1;
 450   s1[112] = CHAR__MAX;
 451   s2[112] = CHAR__MIN;
 452   s1[113] = -13;
 453   s2[113] = -13;
 454   s1[114] = -109;
 455   s2[114] = -109;
 456   s1[115] = 1;
 457   s2[115] = 1;
 458
 459   n = 116;
 460   for (size_t i = 0; i < n; i++)
 461     {
 462       exp_result = SIMPLE_MEMCMP (s1 + i, s2 + i, n - i);
 463       FOR_EACH_IMPL (impl, 0)
 464         check_result (impl, s1 + i, s2 + i, n - i, exp_result);
 465     }
 466 }
 467
 468 int
 469 test_main (void)
 470 {
 471   size_t i;
 472
 473   test_init ();
 474
 475   check1 ();
 476
 477   printf ("%23s", "");
 478   FOR_EACH_IMPL (impl, 0)
 479     printf ("\t%s", impl->name);
 480   putchar ('\n');
 481
 482   for (i = 1; i < 16; ++i)
 483     {
 484       do_test (i * CHARBYTES, i * CHARBYTES, i, 0);
 485       do_test (i * CHARBYTES, i * CHARBYTES, i, 1);
 486       do_test (i * CHARBYTES, i * CHARBYTES, i, -1);
 487     }
 488
 489   for (i = 0; i < 16; ++i)
 490     {
 491       do_test (0, 0, i, 0);
 492       do_test (0, 0, i, 1);
 493       do_test (0, 0, i, -1);
 494     }
 495
 496   for (i = 1; i < 10; ++i)
 497     {
 498       do_test (0, 0, 2 << i, 0);
 499       do_test (0, 0, 2 << i, 1);
 500       do_test (0, 0, 2 << i, -1);
 501       do_test (0, 0, 16 << i, 0);
 502       do_test ((8 - i) * CHARBYTES, (2 * i) * CHARBYTES, 16 << i, 0);
 503       do_test (0, 0, 16 << i, 1);
 504       do_test (0, 0, 16 << i, -1);
 505     }
 506
 507   for (i = 1; i < 8; ++i)
 508     {
 509       do_test (i * CHARBYTES, 2 * (i * CHARBYTES), 8 << i, 0);
 510       do_test (i * CHARBYTES, 2 * (i * CHARBYTES), 8 << i, 1);
 511       do_test (i * CHARBYTES, 2 * (i * CHARBYTES), 8 << i, -1);
 512     }
 513
 514   do_random_tests ();
 515   return ret;
 516 }
 517 #include "../test-skeleton.c"