1 /* Test strncat functions.
2 Copyright (C) 2011-2023 Free Software Foundation, Inc.
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.
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.
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/>. */
20 # define TEST_NAME "strncat"
22 # define TEST_NAME "wcsncat"
24 #include "test-string.h"
27 # define STRNCAT strncat
29 # define UCHAR unsigned char
30 # define SIMPLE_STRNCAT simple_strncat
31 # define STRNLEN strnlen
32 # define STRLEN strlen
33 # define MEMSET memset
34 # define MEMCPY memcpy
35 # define MEMCMP memcmp
36 # define BIG_CHAR CHAR_MAX
37 # define SMALL_CHAR 127
40 # define STRNCAT wcsncat
42 # define UCHAR wchar_t
43 # define SIMPLE_STRNCAT simple_wcsncat
44 # define STRNLEN wcsnlen
45 # define STRLEN wcslen
46 # define MEMSET wmemset
47 # define MEMCPY wmemcpy
48 # define MEMCMP wmemcmp
49 # define BIG_CHAR WCHAR_MAX
50 # define SMALL_CHAR 1273
53 typedef CHAR *(*proto_t) (CHAR *, const CHAR *, size_t);
57 /* Naive implementation to verify results. */
59 SIMPLE_STRNCAT (CHAR *dst, const CHAR *src, size_t n)
62 while (*dst++ != '\0');
65 if ((*dst++ = *src++) == '\0')
72 __attribute__((noinline))
73 do_one_test (impl_t *impl, CHAR *dst, const CHAR *src, size_t n)
75 size_t k = STRLEN (dst);
76 if (CALL (impl, dst, src, n) != dst)
78 error (0, 0, "Wrong result in function %s %p != %p", impl->name,
79 CALL (impl, dst, src, n), dst);
84 size_t len = STRNLEN (src, n);
85 if (MEMCMP (dst + k, src, len + 1 > n ? n : len + 1) != 0)
87 error (0, 0, "Incorrect concatenation in function %s",
92 if (n < len && dst[k + n] != '\0')
94 error (0, 0, "There is no zero in the end of output string in %s",
102 do_test_src_no_nullterm_bz30065 (void)
104 /* NB: "src does not need to be null-terminated if it contains n or more
107 size_t bound = page_size / sizeof (CHAR);
108 s1 = (CHAR *) (buf1 + BUF1PAGES * page_size);
110 MEMSET (s1 - bound, -1, bound);
111 for (size_t n = 0; n < bound; ++n)
113 FOR_EACH_IMPL (impl, 0)
116 do_one_test (impl, s2, s1 - n, n);
122 do_test (size_t align1, size_t align2, size_t len1, size_t len2,
123 size_t n, int max_char)
129 if ((align1 + len1) * sizeof (CHAR) >= page_size)
131 if ((align1 + n) * sizeof (CHAR) > page_size)
134 if ((align2 + len1 + len2) * sizeof (CHAR) >= page_size)
136 if ((align2 + len1 + n) * sizeof (CHAR) > page_size)
138 s1 = (CHAR *) (buf1) + align1;
139 s2 = (CHAR *) (buf2) + align2;
141 for (i = 0; i < len1; ++i)
142 s1[i] = 32 + 23 * i % (max_char - 32);
145 for (i = 0; i < len2; i++)
146 s2[i] = 32 + 23 * i % (max_char - 32);
148 FOR_EACH_IMPL (impl, 0)
151 do_one_test (impl, s2, s1, n);
156 do_overflow_tests (void)
159 const size_t one = 1;
164 s1_addr = (uintptr_t)s1;
165 for (j = 0; j < 200; ++j)
166 s2[j] = 32 + 23 * j % (BIG_CHAR - 32);
168 for (i = 0; i < 750; ++i) {
169 for (j = 0; j < i; ++j)
170 s1[j] = 32 + 23 * j % (BIG_CHAR - 32);
173 FOR_EACH_IMPL (impl, 0)
176 do_one_test (impl, s2, s1, SIZE_MAX - i);
178 do_one_test (impl, s2, s1, i - s1_addr);
180 do_one_test (impl, s2, s1, -s1_addr - i);
182 do_one_test (impl, s2, s1, SIZE_MAX - s1_addr - i);
184 do_one_test (impl, s2, s1, SIZE_MAX - s1_addr + i);
188 for (j = 8 * sizeof(size_t) - 1; j ; --j)
191 FOR_EACH_IMPL (impl, 0)
194 do_one_test (impl, s2, s1, len - i);
196 do_one_test (impl, s2, s1, len + i);
198 do_one_test (impl, s2, s1, len - s1_addr - i);
200 do_one_test (impl, s2, s1, len - s1_addr + i);
203 do_one_test (impl, s2, s1, ~len - i);
205 do_one_test (impl, s2, s1, ~len + i);
207 do_one_test (impl, s2, s1, ~len - s1_addr - i);
209 do_one_test (impl, s2, s1, ~len - s1_addr + i);
216 do_random_tests (void)
218 size_t i, j, n, align1, align2, len1, len2, N;
219 UCHAR *p1 = (UCHAR *) (buf1 + page_size) - 512;
220 UCHAR *p2 = (UCHAR *) (buf2 + page_size) - 512;
221 UCHAR *p3 = (UCHAR *) buf1;
223 fprintf (stdout, "Number of iterations in random test = %zd\n",
225 for (n = 0; n < ITERATIONS; n++)
228 align1 = random () & 31;
230 align2 = random () & 31;
232 align2 = align1 + (random () & 24);
233 len1 = random () & 511;
234 if (len1 + align2 > 512)
235 len2 = random () & 7;
237 len2 = (512 - len1 - align2) * (random () & (1024 * 1024 - 1))
240 if (align2 + len2 > j)
243 len1 = 510 - j - (random () & 7);
246 if (align1 + len1 < 512 - 8)
248 j = 510 - align1 - len1 - (random () & 31);
249 if (j > 0 && j < 512)
252 j = len1 + align1 + 64;
255 for (i = 0; i < j; i++)
257 if (i == len1 + align1)
261 p1[i] = random () & BIG_CHAR;
262 if (i >= align1 && i < len1 + align1 && !p1[i])
263 p1[i] = (random () & SMALL_CHAR) + 3;
266 for (i = 0; i < len2; i++)
268 p3[i] = random () & BIG_CHAR;
270 p3[i] = (random () & SMALL_CHAR) + 3;
274 FOR_EACH_IMPL (impl, 1)
276 MEMSET (p2 - 64, '\1', align2 + 64);
277 MEMSET (p2 + align2 + len2 + 1, '\1', 512 - align2 - len2 - 1);
278 MEMCPY (p2 + align2, p3, len2 + 1);
279 res = (UCHAR *) CALL (impl, (CHAR *) (p2 + align2),
280 (CHAR *) (p1 + align1), N);
281 if (res != p2 + align2)
283 error (0, 0, "Iteration %zd - wrong result in function %s "
284 "(%zd, %zd, %zd, %zd, %zd) %p != %p",
285 n, impl->name, align1, align2, len1, len2, N,
289 for (j = 0; j < align2 + 64; ++j)
291 if (p2[j - 64] != '\1')
293 error (0, 0, "Iteration %zd - garbage before dst, %s "
294 "%zd, %zd, %zd, %zd, %zd)",
295 n, impl->name, align1, align2, len1, len2, N);
300 if (MEMCMP (p2 + align2, p3, len2))
302 error (0, 0, "Iteration %zd - garbage in string before, %s "
303 "(%zd, %zd, %zd, %zd, %zd)",
304 n, impl->name, align1, align2, len1, len2, N);
309 j = align2 + N + 1 + len2;
311 j = align2 + len1 + 1 + len2;
316 error (0, 0, "Iteration %zd - garbage after, %s "
317 "(%zd, %zd, %zd, %zd, %zd)",
318 n, impl->name, align1, align2, len1, len2, N);
325 if (p2[align2 + N + len2] != '\0')
327 error (0, 0, "Iteration %zd - there is no zero at the "
328 "end of output string, %s (%zd, %zd, %zd, %zd, %zd)",
329 n, impl->name, align1, align2, len1, len2, N);
333 if (MEMCMP (p1 + align1, p2 + align2 + len2,
334 (len1 + 1) > N ? N : len1 + 1))
336 error (0, 0, "Iteration %zd - different strings, %s "
337 "(%zd, %zd, %zd, %zd, %zd)",
338 n, impl->name, align1, align2, len1, len2, N);
353 FOR_EACH_IMPL (impl, 0)
354 printf ("\t%s", impl->name);
357 for (n = 2; n <= 2048; n*=4)
359 do_test (0, 2, 2, 2, n, SMALL_CHAR);
360 do_test (0, 0, 4, 4, n, SMALL_CHAR);
361 do_test (4, 0, 4, 4, n, BIG_CHAR);
362 do_test (0, 0, 8, 8, n, SMALL_CHAR);
363 do_test (0, 8, 8, 8, n, SMALL_CHAR);
365 do_test (0, 2, 2, 2, SIZE_MAX, SMALL_CHAR);
366 do_test (0, 0, 4, 4, SIZE_MAX, SMALL_CHAR);
367 do_test (4, 0, 4, 4, SIZE_MAX, BIG_CHAR);
368 do_test (0, 0, 8, 8, SIZE_MAX, SMALL_CHAR);
369 do_test (0, 8, 8, 8, SIZE_MAX, SMALL_CHAR);
371 for (i = 1; i < 8; ++i)
373 do_test (0, 0, 8 << i, 8 << i, n, SMALL_CHAR);
374 do_test (8 - i, 2 * i, 8 << i, 8 << i, n, SMALL_CHAR);
375 do_test (0, 0, 8 << i, 2 << i, n, SMALL_CHAR);
376 do_test (8 - i, 2 * i, 8 << i, 2 << i, n, SMALL_CHAR);
378 do_test (0, 0, 8 << i, 8 << i, SIZE_MAX, SMALL_CHAR);
379 do_test (8 - i, 2 * i, 8 << i, 8 << i, SIZE_MAX, SMALL_CHAR);
380 do_test (0, 0, 8 << i, 2 << i, SIZE_MAX, SMALL_CHAR);
381 do_test (8 - i, 2 * i, 8 << i, 2 << i, SIZE_MAX, SMALL_CHAR);
384 for (i = 1; i < 8; ++i)
386 do_test (i, 2 * i, 8 << i, 1, n, SMALL_CHAR);
387 do_test (2 * i, i, 8 << i, 1, n, BIG_CHAR);
388 do_test (i, i, 8 << i, 10, n, SMALL_CHAR);
390 do_test (i, 2 * i, 8 << i, 1, SIZE_MAX, SMALL_CHAR);
391 do_test (2 * i, i, 8 << i, 1, SIZE_MAX, BIG_CHAR);
392 do_test (i, i, 8 << i, 10, SIZE_MAX, SMALL_CHAR);
397 do_overflow_tests ();
398 do_test_src_no_nullterm_bz30065 ();
402 #include <support/test-driver.c>