1 /* Test strlen functions.
2 Copyright (C) 1999-2022 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
4
5 The GNU C Library is free software; you can redistribute it and/or
6 modify it under the terms of the GNU Lesser General Public
7 License as published by the Free Software Foundation; either
8 version 2.1 of the License, or (at your option) any later version.
9
10 The GNU C Library is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 Lesser General Public License for more details.
14
15 You should have received a copy of the GNU Lesser General Public
16 License along with the GNU C Library; if not, see
17 <https://www.gnu.org/licenses/>. */
18
19 #define TEST_MAIN
20 #ifndef WIDE
21 # define TEST_NAME "strnlen"
22 #else
23 # define TEST_NAME "wcsnlen"
24 #endif /* !WIDE */
25 #include "test-string.h"
26
27 #ifndef WIDE
28 # define STRNLEN strnlen
29 # define MEMSET memset
30 # define CHAR char
31 # define BIG_CHAR CHAR_MAX
32 # define MIDDLE_CHAR 127
33 # define SIMPLE_STRNLEN simple_strnlen
34 #else
35 # include <wchar.h>
36 # define STRNLEN wcsnlen
37 # define MEMSET wmemset
38 # define CHAR wchar_t
39 # define BIG_CHAR WCHAR_MAX
40 # define MIDDLE_CHAR 1121
41 # define SIMPLE_STRNLEN simple_wcsnlen
42 #endif /* !WIDE */
43
44 typedef size_t (*proto_t) (const CHAR *, size_t);
45
46 IMPL (STRNLEN, 1)
47
48 /* Naive implementation to verify results. */
49 size_t
SIMPLE_STRNLEN(const CHAR * s,size_t maxlen)50 SIMPLE_STRNLEN (const CHAR *s, size_t maxlen)
51 {
52 size_t i;
53
54 for (i = 0; i < maxlen && s[i]; ++i);
55 return i;
56 }
57
58 static void
do_one_test(impl_t * impl,const CHAR * s,size_t maxlen,size_t exp_len)59 do_one_test (impl_t *impl, const CHAR *s, size_t maxlen, size_t exp_len)
60 {
61 size_t len = CALL (impl, s, maxlen);
62 if (len != exp_len)
63 {
64 error (0, 0, "Wrong result in function %s %zd %zd", impl->name,
65 len, exp_len);
66 ret = 1;
67 return;
68 }
69 }
70
71 static void
do_test(size_t align,size_t len,size_t maxlen,int max_char)72 do_test (size_t align, size_t len, size_t maxlen, int max_char)
73 {
74 size_t i;
75
76 align &= 63;
77 if ((align + len) * sizeof (CHAR) >= page_size)
78 return;
79
80 CHAR *buf = (CHAR *) (buf1);
81
82 for (i = 0; i < len; ++i)
83 buf[align + i] = 1 + 11111 * i % max_char;
84 buf[align + len] = 0;
85
86 FOR_EACH_IMPL (impl, 0)
87 do_one_test (impl, (CHAR *) (buf + align), maxlen, MIN (len, maxlen));
88 }
89
90 static void
do_overflow_tests(void)91 do_overflow_tests (void)
92 {
93 size_t i, j, len;
94 const size_t one = 1;
95 uintptr_t buf_addr = (uintptr_t) buf1;
96
97 for (i = 0; i < 750; ++i)
98 {
99 do_test (1, i, SIZE_MAX, BIG_CHAR);
100
101 do_test (0, i, SIZE_MAX - i, BIG_CHAR);
102 do_test (0, i, i - buf_addr, BIG_CHAR);
103 do_test (0, i, -buf_addr - i, BIG_CHAR);
104 do_test (0, i, SIZE_MAX - buf_addr - i, BIG_CHAR);
105 do_test (0, i, SIZE_MAX - buf_addr + i, BIG_CHAR);
106
107 len = 0;
108 for (j = 8 * sizeof(size_t) - 1; j ; --j)
109 {
110 len |= one << j;
111 do_test (0, i, len - i, BIG_CHAR);
112 do_test (0, i, len + i, BIG_CHAR);
113 do_test (0, i, len - buf_addr - i, BIG_CHAR);
114 do_test (0, i, len - buf_addr + i, BIG_CHAR);
115
116 do_test (0, i, ~len - i, BIG_CHAR);
117 do_test (0, i, ~len + i, BIG_CHAR);
118 do_test (0, i, ~len - buf_addr - i, BIG_CHAR);
119 do_test (0, i, ~len - buf_addr + i, BIG_CHAR);
120
121 do_test (0, i, -buf_addr, BIG_CHAR);
122 do_test (0, i, j - buf_addr, BIG_CHAR);
123 do_test (0, i, -buf_addr - j, BIG_CHAR);
124 }
125 }
126 }
127
128 static void
do_random_tests(void)129 do_random_tests (void)
130 {
131 size_t i, j, n, align, len;
132 CHAR *p = (CHAR *) (buf1 + page_size - 512 * sizeof (CHAR));
133
134 for (n = 0; n < ITERATIONS; n++)
135 {
136 align = random () & 15;
137 len = random () & 511;
138 if (len + align > 510)
139 len = 511 - align - (random () & 7);
140 j = len + align + 64;
141 if (j > 512)
142 j = 512;
143
144 for (i = 0; i < j; i++)
145 {
146 if (i == len + align)
147 p[i] = 0;
148 else
149 {
150 p[i] = random () & 255;
151 if (i >= align && i < len + align && !p[i])
152 p[i] = (random () & 127) + 1;
153 }
154 }
155
156 FOR_EACH_IMPL (impl, 1)
157 {
158 if (len > 0
159 && CALL (impl, (CHAR *) (p + align), len - 1) != len - 1)
160 {
161 error (0, 0, "Iteration %zd (limited) - wrong result in function %s (%zd) %zd != %zd, p %p",
162 n, impl->name, align,
163 CALL (impl, (CHAR *) (p + align), len - 1), len - 1, p);
164 ret = 1;
165 }
166 if (CALL (impl, (CHAR *) (p + align), len) != len)
167 {
168 error (0, 0, "Iteration %zd (exact) - wrong result in function %s (%zd) %zd != %zd, p %p",
169 n, impl->name, align,
170 CALL (impl, (CHAR *) (p + align), len), len, p);
171 ret = 1;
172 }
173 if (CALL (impl, (CHAR *) (p + align), len + 1) != len)
174 {
175 error (0, 0, "Iteration %zd (long) - wrong result in function %s (%zd) %zd != %zd, p %p",
176 n, impl->name, align,
177 CALL (impl, (CHAR *) (p + align), len + 1), len, p);
178 ret = 1;
179 }
180 }
181 }
182 }
183
184 /* Tests meant to unveil fail on implementation that does not access bytes
185 around the page boundary accordingly. */
186 static void
do_page_tests(void)187 do_page_tests (void)
188 {
189 size_t i, exp_len, start_offset, offset;
190 /* Calculate the null character offset. */
191 size_t last_offset = (page_size / sizeof (CHAR)) - 1;
192
193 CHAR *s = (CHAR *) buf2;
194 MEMSET (s, 65, (last_offset - 1));
195 s[last_offset] = 0;
196
197 /* Place short strings ending at page boundary. */
198 offset = last_offset;
199 for (i = 0; i < 128; i++)
200 {
201 /* Decrease offset to stress several sizes and alignments. */
202 offset--;
203 exp_len = last_offset - offset;
204 FOR_EACH_IMPL (impl, 0)
205 {
206 /* Varies maxlen value to cover the cases where it is:
207 - larger than length;
208 - slightly greater than length;
209 - equal to length;
210 - slightly less than length. */
211 do_one_test (impl, (CHAR *) (s + offset), page_size, exp_len);
212 do_one_test (impl, (CHAR *) (s + offset), exp_len + 1, exp_len);
213 do_one_test (impl, (CHAR *) (s + offset), exp_len, exp_len);
214 if (exp_len > 0)
215 do_one_test (impl, (CHAR *) (s + offset), exp_len - 1, exp_len - 1);
216 }
217 }
218
219 /* Place long strings ending at page boundary. */
220 start_offset = (last_offset + 1) / 2;
221 for (i = 0; i < 64; ++i)
222 {
223 /* Increase offset to stress several alignments. */
224 offset = start_offset + i;
225 if (offset >= (last_offset + 1))
226 break;
227 exp_len = last_offset - offset;
228 FOR_EACH_IMPL (impl, 0)
229 {
230 /* Checks only for maxlen much larger than length because smaller
231 values are already covered in do_random_tests function. */
232 do_one_test (impl, (CHAR *) (s + offset), page_size, exp_len);
233 }
234 }
235 }
236
237 /* Tests meant to unveil fail on implementations that access bytes
238 beyond the maxium length. */
239
240 static void
do_page_2_tests(void)241 do_page_2_tests (void)
242 {
243 size_t i, exp_len, offset;
244 size_t last_offset = page_size / sizeof (CHAR);
245
246 CHAR *s = (CHAR *) buf2;
247 MEMSET (s, 65, last_offset);
248
249 /* Place short strings ending at page boundary without the null
250 byte. */
251 offset = last_offset;
252 for (i = 0; i < 128; i++)
253 {
254 /* Decrease offset to stress several sizes and alignments. */
255 offset--;
256 exp_len = last_offset - offset;
257 FOR_EACH_IMPL (impl, 0)
258 {
259 /* If an implementation goes beyond EXP_LEN, it will trigger
260 the segfault. */
261 do_one_test (impl, (CHAR *) (s + offset), exp_len, exp_len);
262 }
263 }
264 }
265
266 int
test_main(void)267 test_main (void)
268 {
269 size_t i, length, char_per_page;
270
271 test_init ();
272
273 printf ("%20s", "");
274 FOR_EACH_IMPL (impl, 0)
275 printf ("\t%s", impl->name);
276 putchar ('\n');
277
278 for (i = 1; i < 8; ++i)
279 {
280 do_test (0, i, i - 1, MIDDLE_CHAR);
281 do_test (0, i, i, MIDDLE_CHAR);
282 do_test (0, i, i + 1, MIDDLE_CHAR);
283 }
284
285 for (i = 1; i < 8; ++i)
286 {
287 do_test (i, i, i - 1, MIDDLE_CHAR);
288 do_test (i, i, i, MIDDLE_CHAR);
289 do_test (i, i, i + 1, MIDDLE_CHAR);
290 }
291
292 for (i = 2; i <= 10; ++i)
293 {
294 do_test (0, 1 << i, 5000, MIDDLE_CHAR);
295 do_test (1, 1 << i, 5000, MIDDLE_CHAR);
296 }
297
298 for (i = 1; i < 8; ++i)
299 do_test (0, i, 5000, BIG_CHAR);
300
301 for (i = 1; i < 8; ++i)
302 do_test (i, i, 5000, BIG_CHAR);
303
304 for (i = 2; i <= 10; ++i)
305 {
306 do_test (0, 1 << i, 5000, BIG_CHAR);
307 do_test (1, 1 << i, 5000, BIG_CHAR);
308 }
309
310 char_per_page = getpagesize () / sizeof (CHAR);
311
312 for (i = 0; i <= 127; i++)
313 for (length = i; length <= 512; length++)
314 {
315 do_test (i, length, 512, BIG_CHAR);
316 do_test (char_per_page - i, length, 512, BIG_CHAR);
317 }
318
319 do_random_tests ();
320 do_page_tests ();
321 do_page_2_tests ();
322 do_overflow_tests ();
323 return ret;
324 }
325
326 #include <support/test-driver.c>
327