string/tst-strlcat2.c

   1 /* Test strlcat functions.
   2    Copyright (C) 2023-2024 Free Software Foundation, Inc.
   3
   4    The GNU C Library is free software; you can redistribute it and/or
   5    modify it under the terms of the GNU Lesser General Public
   6    License as published by the Free Software Foundation; either
   7    version 2.1 of the License, or (at your option) any later version.
   8
   9    The GNU C Library is distributed in the hope that it will be useful,
  10    but WITHOUT ANY WARRANTY; without even the implied warranty of
  11    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  12    Lesser General Public License for more details.
  13
  14    You should have received a copy of the GNU Lesser General Public
  15    License along with the GNU C Library; if not, see
  16    <https://www.gnu.org/licenses/>.  */
  17
  18 #define TEST_MAIN
  19 #ifndef WIDE
  20 # define TEST_NAME "strlcat"
  21 #else
  22 # define TEST_NAME "wcslcat"
  23 #endif /* WIDE */
  24 #include "test-string.h"
  25
  26 #ifdef WIDE
  27 # include <wchar.h>
  28 # define BIG_CHAR WCHAR_MAX
  29 # define CHAR wchar_t
  30 # define MEMCMP wmemcmp
  31 # define MEMCPY wmemcpy
  32 # define MEMSET wmemset
  33 # define SIMPLE_STRLCAT simple_wcslcat
  34 # define SMALL_CHAR 1273
  35 # define STRLCAT wcslcat
  36 # define STRLEN wcslen
  37 # define STRNLEN wcsnlen
  38 # define UCHAR wchar_t
  39 #else
  40 # define BIG_CHAR CHAR_MAX
  41 # define CHAR char
  42 # define MEMCMP memcmp
  43 # define MEMCPY memcpy
  44 # define MEMSET memset
  45 # define SMALL_CHAR 127
  46 # define SIMPLE_STRLCAT simple_strlcat
  47 # define STRLCAT strlcat
  48 # define STRLEN strlen
  49 # define STRNLEN strnlen
  50 # define UCHAR unsigned char
  51 #endif /* !WIDE */
  52
  53 /* Naive implementation to verify results.  */
  54 size_t
  55 SIMPLE_STRLCAT (CHAR *dst, const CHAR *src, size_t n)
  56 {
  57   size_t src_length = STRLEN (src);
  58
  59   if (n == 0)
  60     return src_length;
  61
  62   size_t dst_length = STRNLEN (dst, n);
  63
  64   if (dst_length != n)
  65     {
  66       size_t to_copy = n - dst_length - 1;
  67
  68       if (to_copy > src_length)
  69         to_copy = src_length;
  70
  71       CHAR *target = dst + dst_length;
  72       MEMCPY (target, src, to_copy);
  73       target[to_copy] = '\0';
  74     }
  75   return dst_length + src_length;
  76 }
  77
  78 IMPL (SIMPLE_STRLCAT, 0)
  79 IMPL (STRLCAT, 1)
  80
  81 typedef size_t (*proto_t) (CHAR *, const CHAR *, size_t);
  82
  83 static void
  84 __attribute__((noinline))
  85 do_one_test (impl_t *impl, CHAR *dst, const CHAR *src,
  86              size_t n)
  87 {
  88   size_t exp_ret, func_ret;
  89   size_t src_length = STRLEN (src);
  90   size_t dst_length = STRNLEN (dst, n);
  91
  92   if  (n == 0)
  93     exp_ret = src_length;
  94   else
  95     exp_ret = src_length + dst_length;
  96
  97   func_ret = CALL (impl, dst, src, n);
  98   if (exp_ret != func_ret)
  99     {
 100       error (0, 0, "Wrong result in function %s %zd != %zd", impl->name,
 101              exp_ret, func_ret);
 102       ret = 1;
 103       return;
 104     }
 105
 106   if (dst_length != n)
 107     {
 108       size_t to_copy = n - dst_length - 1;
 109       if (to_copy > src_length)
 110         to_copy = src_length;
 111       if (MEMCMP (dst + dst_length, src, to_copy) != 0)
 112         {
 113           error (0, 0, "Incorrect concatenation in function %s",
 114                  impl->name);
 115           ret = 1;
 116           return;
 117         }
 118       if (dst[dst_length + to_copy] != '\0')
 119         {
 120           error (0, 0, "There is no zero in the end of output string in %s",
 121                  impl->name);
 122           ret = 1;
 123           return;
 124         }
 125     }
 126   return;
 127 }
 128
 129 static void
 130 do_test (size_t align1, size_t align2, size_t len1, size_t len2,
 131          size_t n, int max_char)
 132 {
 133   size_t i;
 134   CHAR *s1, *s2;
 135
 136   align1 &= 7;
 137   if ((align1 + len1) * sizeof (CHAR) >= page_size)
 138     return;
 139   if ((align1 + n) * sizeof (CHAR) > page_size)
 140     return;
 141   align2 &= 7;
 142   if ((align2 + len1 + len2) * sizeof (CHAR) >= page_size)
 143     return;
 144   if ((align2 + len1 + n) * sizeof (CHAR) > page_size)
 145     return;
 146   s1 = (CHAR *) (buf1) + align1;
 147   s2 = (CHAR *) (buf2) + align2;
 148
 149   for (i = 0; i < len1; ++i)
 150     s1[i] = 32 + 23 * i % (max_char - 32);
 151   s1[len1] = '\0';
 152
 153   FOR_EACH_IMPL (impl, 0)
 154     {
 155
 156       for (i = 0; i < len2; i++)
 157         s2[i] = 32 + 23 * i % (max_char - 32);
 158       s2[len2] = '\0';
 159
 160       do_one_test (impl, s2, s1, n);
 161     }
 162 }
 163
 164 static void
 165 do_overflow_tests (void)
 166 {
 167   size_t i, j, len;
 168   const size_t one = 1;
 169   CHAR *s1, *s2;
 170   uintptr_t s1_addr;
 171   s1 = (CHAR *) buf1;
 172   s2 = (CHAR *) buf2;
 173   s1_addr = (uintptr_t)s1;
 174   for (j = 0; j < 200; ++j)
 175     s2[j] = 32 + 23 * j % (BIG_CHAR - 32);
 176   s2[200] = 0;
 177   for (i = 0; i < 750; ++i) {
 178     for (j = 0; j < i; ++j)
 179       s1[j] = 32 + 23 * j % (BIG_CHAR - 32);
 180     s1[i] = '\0';
 181
 182     FOR_EACH_IMPL (impl, 0)
 183       {
 184         s2[200] = '\0';
 185         do_one_test (impl, s2, s1, SIZE_MAX - i);
 186         s2[200] = '\0';
 187         do_one_test (impl, s2, s1, i - s1_addr);
 188         s2[200] = '\0';
 189         do_one_test (impl, s2, s1, -s1_addr - i);
 190         s2[200] = '\0';
 191         do_one_test (impl, s2, s1, SIZE_MAX - s1_addr - i);
 192         s2[200] = '\0';
 193         do_one_test (impl, s2, s1, SIZE_MAX - s1_addr + i);
 194       }
 195
 196     len = 0;
 197     for (j = 8 * sizeof(size_t) - 1; j ; --j)
 198       {
 199         len |= one << j;
 200         FOR_EACH_IMPL (impl, 0)
 201           {
 202             s2[200] = '\0';
 203             do_one_test (impl, s2, s1, len - i);
 204             s2[200] = '\0';
 205             do_one_test (impl, s2, s1, len + i);
 206             s2[200] = '\0';
 207             do_one_test (impl, s2, s1, len - s1_addr - i);
 208             s2[200] = '\0';
 209             do_one_test (impl, s2, s1, len - s1_addr + i);
 210
 211             s2[200] = '\0';
 212             do_one_test (impl, s2, s1, ~len - i);
 213             s2[200] = '\0';
 214             do_one_test (impl, s2, s1, ~len + i);
 215             s2[200] = '\0';
 216             do_one_test (impl, s2, s1, ~len - s1_addr - i);
 217             s2[200] = '\0';
 218             do_one_test (impl, s2, s1, ~len - s1_addr + i);
 219           }
 220       }
 221   }
 222 }
 223
 224 static void
 225 do_random_tests (void)
 226 {
 227   size_t i, j, n, align1, align2, len1, len2, N;
 228   UCHAR *p1 = (UCHAR *) (buf1 + page_size) - 1024;
 229   UCHAR *p2 = (UCHAR *) (buf2 + page_size) - 1024;
 230   UCHAR *p3 = (UCHAR *) buf1;
 231   size_t res;
 232   fprintf (stdout, "Number of iterations in random test = %zd\n",
 233            ITERATIONS);
 234   for (n = 0; n < ITERATIONS; n++)
 235     {
 236       N = random () & 1023;
 237       align1 = random () & 255;
 238       align2 = random () & 255;
 239       len1 = random () & 255;
 240       len2 = random () & 255;
 241
 242       for (i = 0; i < len1; i++)
 243         {
 244           p1[align1 + i] = random () & BIG_CHAR;
 245           if (!p1[align1 + i])
 246             p1[align1 + i] = (random () & SMALL_CHAR) + 3;
 247         }
 248       p1[align1 + len1] = 0;
 249
 250       for (i = 0; i < len2; i++)
 251         {
 252           p3[i] = random () & BIG_CHAR;
 253           if (!p3[i])
 254             p3[i] = (random () & SMALL_CHAR) + 3;
 255         }
 256       p3[len2] = 0;
 257
 258       size_t exp_ret;
 259       size_t src_length = STRLEN ((CHAR *) (p1 + align1));
 260       size_t dst_length = STRNLEN ((CHAR *) (p3), N);
 261
 262       if  (N == 0)
 263         exp_ret = src_length;
 264       else
 265         exp_ret = src_length + dst_length;
 266
 267       FOR_EACH_IMPL (impl, 1)
 268         {
 269           MEMSET (p2 - 64, '\1', align2 + 64);
 270           MEMSET (p2 + align2 + len2 + 1, '\1', 1024 - align2 - len2 - 1);
 271           MEMCPY (p2 + align2, p3, len2 + 1);
 272           res = CALL (impl, (CHAR *) (p2 + align2),
 273                       (CHAR *) (p1 + align1), N);
 274           if (res != exp_ret)
 275             {
 276               error (0, 0, "Iteration %zd - wrong result in function %s "
 277                      "(%zd, %zd, %zd, %zd, %zd) %zd != %zd",
 278                      n, impl->name, align1, align2, len1, len2, N,
 279                      res, exp_ret);
 280               ret = 1;
 281             }
 282
 283           for (j = 0; j < align2 + 64; ++j)
 284             {
 285               if (p2[j - 64] != '\1')
 286                 {
 287                   error (0, 0, "Iteration %zd - garbage before dst, %s "
 288                          "%zd, %zd, %zd, %zd, %zd)",
 289                          n, impl->name, align1, align2, len1, len2, N);
 290                   ret = 1;
 291                   break;
 292                 }
 293             }
 294           if (MEMCMP (p2 + align2, p3, len2))
 295             {
 296               error (0, 0, "Iteration %zd - garbage in string before, %s "
 297                      "(%zd, %zd, %zd, %zd, %zd)",
 298                      n, impl->name, align1, align2, len1, len2, N);
 299               ret = 1;
 300             }
 301           if (N > len2 + 1)
 302             {
 303               j = (N - len2 - 1 >= len1) ? len1 : N - len2 - 1;
 304               if (MEMCMP (p2 + align2 + len2, p1 + align1, j))
 305                 {
 306                   error (0, 0, "Iteration %zd - different strings, %s "
 307                          "(%zd, %zd, %zd, %zd)", n, impl->name, align1,
 308                          align2, len2, j);
 309                   ret = 1;
 310                 }
 311
 312               if (p2[align2 + len2 + j] != '\0')
 313                 {
 314                   error (0, 0, "Iteration %zd - there is no zero at the "
 315                          "end of output string, %s (%zd, %zd, %zd, %zd, %zd)",
 316                          n, impl->name, align1, align2, len1, len2, N);
 317                   ret = 1;
 318                 }
 319
 320               for (j = j + align2 + len2 + 1; j < 1024; ++j)
 321                 {
 322                   if (p2[j] != '\1')
 323                     {
 324                       error (0, 0, "Iteration %zd - garbage after, %s "
 325                              "(%zd, %zd, %zd, %zd, %zd)",
 326                              n, impl->name, align1, align2, len1, len2, N);
 327                       ret = 1;
 328                       break;
 329                     }
 330                 }
 331             }
 332           else
 333             {
 334               if (p2[align2 + len2] != '\0')
 335                 {
 336                   error (0, 0, "Iteration %zd - destination modified, %s "
 337                          "(%zd, %zd, %zd, %zd, %zd)",
 338                          n, impl->name, align1, align2, len1, len2, N);
 339                   ret = 1;
 340                 }
 341             }
 342         }
 343     }
 344 }
 345
 346 int
 347 test_main (void)
 348 {
 349   size_t i, n;
 350
 351   test_init ();
 352
 353   printf ("%28s", "");
 354   FOR_EACH_IMPL (impl, 0)
 355     printf ("\t%s", impl->name);
 356   putchar ('\n');
 357
 358   for (n = 2; n <= 2048; n*=4)
 359     {
 360       do_test (0, 2, 2, 2, n, SMALL_CHAR);
 361       do_test (0, 0, 4, 4, n, SMALL_CHAR);
 362       do_test (4, 0, 4, 4, n, BIG_CHAR);
 363       do_test (0, 0, 8, 8, n, SMALL_CHAR);
 364       do_test (0, 8, 8, 8, n, SMALL_CHAR);
 365
 366       do_test (0, 2, 2, 2, SIZE_MAX, SMALL_CHAR);
 367       do_test (0, 0, 4, 4, SIZE_MAX, SMALL_CHAR);
 368       do_test (4, 0, 4, 4, SIZE_MAX, BIG_CHAR);
 369       do_test (0, 0, 8, 8, SIZE_MAX, SMALL_CHAR);
 370       do_test (0, 8, 8, 8, SIZE_MAX, SMALL_CHAR);
 371
 372       for (i = 1; i < 8; ++i)
 373         {
 374           do_test (0, 0, 8 << i, 8 << i, n, SMALL_CHAR);
 375           do_test (8 - i, 2 * i, 8 << i, 8 << i, n, SMALL_CHAR);
 376           do_test (0, 0, 8 << i, 2 << i, n, SMALL_CHAR);
 377           do_test (8 - i, 2 * i, 8 << i, 2 << i, n, SMALL_CHAR);
 378
 379           do_test (0, 0, 8 << i, 8 << i, SIZE_MAX, SMALL_CHAR);
 380           do_test (8 - i, 2 * i, 8 << i, 8 << i, SIZE_MAX, SMALL_CHAR);
 381           do_test (0, 0, 8 << i, 2 << i, SIZE_MAX, SMALL_CHAR);
 382           do_test (8 - i, 2 * i, 8 << i, 2 << i, SIZE_MAX, SMALL_CHAR);
 383         }
 384
 385       for (i = 1; i < 8; ++i)
 386         {
 387           do_test (i, 2 * i, 8 << i, 1, n, SMALL_CHAR);
 388           do_test (2 * i, i, 8 << i, 1, n, BIG_CHAR);
 389           do_test (i, i, 8 << i, 10, n, SMALL_CHAR);
 390
 391           do_test (i, 2 * i, 8 << i, 1, SIZE_MAX, SMALL_CHAR);
 392           do_test (2 * i, i, 8 << i, 1, SIZE_MAX, BIG_CHAR);
 393           do_test (i, i, 8 << i, 10, SIZE_MAX, SMALL_CHAR);
 394         }
 395     }
 396
 397   do_random_tests ();
 398   do_overflow_tests ();
 399   return ret;
 400 }
 401
 402 #include <support/test-driver.c>