1 /* Test strlen functions.
2 Copyright (C) 1999-2021 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 size_t SIMPLE_STRNLEN (const CHAR *, size_t);
46
47 IMPL (SIMPLE_STRNLEN, 0)
48 IMPL (STRNLEN, 1)
49
50 size_t
SIMPLE_STRNLEN(const CHAR * s,size_t maxlen)51 SIMPLE_STRNLEN (const CHAR *s, size_t maxlen)
52 {
53 size_t i;
54
55 for (i = 0; i < maxlen && s[i]; ++i);
56 return i;
57 }
58
59 static void
do_one_test(impl_t * impl,const CHAR * s,size_t maxlen,size_t exp_len)60 do_one_test (impl_t *impl, const CHAR *s, size_t maxlen, size_t exp_len)
61 {
62 size_t len = CALL (impl, s, maxlen);
63 if (len != exp_len)
64 {
65 error (0, 0, "Wrong result in function %s %zd %zd", impl->name,
66 len, exp_len);
67 ret = 1;
68 return;
69 }
70 }
71
72 static void
do_test(size_t align,size_t len,size_t maxlen,int max_char)73 do_test (size_t align, size_t len, size_t maxlen, int max_char)
74 {
75 size_t i;
76
77 align &= 63;
78 if ((align + len) * sizeof (CHAR) >= page_size)
79 return;
80
81 CHAR *buf = (CHAR *) (buf1);
82
83 for (i = 0; i < len; ++i)
84 buf[align + i] = 1 + 11111 * i % max_char;
85 buf[align + len] = 0;
86
87 FOR_EACH_IMPL (impl, 0)
88 do_one_test (impl, (CHAR *) (buf + align), maxlen, MIN (len, maxlen));
89 }
90
91 static void
do_overflow_tests(void)92 do_overflow_tests (void)
93 {
94 size_t i, j, len;
95 const size_t one = 1;
96 uintptr_t buf_addr = (uintptr_t) buf1;
97
98 for (i = 0; i < 750; ++i)
99 {
100 do_test (0, i, SIZE_MAX - i, BIG_CHAR);
101 do_test (0, i, i - buf_addr, BIG_CHAR);
102 do_test (0, i, -buf_addr - i, BIG_CHAR);
103 do_test (0, i, SIZE_MAX - buf_addr - i, BIG_CHAR);
104 do_test (0, i, SIZE_MAX - buf_addr + i, BIG_CHAR);
105
106 len = 0;
107 for (j = 8 * sizeof(size_t) - 1; j ; --j)
108 {
109 len |= one << j;
110 do_test (0, i, len - i, BIG_CHAR);
111 do_test (0, i, len + i, BIG_CHAR);
112 do_test (0, i, len - buf_addr - i, BIG_CHAR);
113 do_test (0, i, len - buf_addr + i, BIG_CHAR);
114
115 do_test (0, i, ~len - i, BIG_CHAR);
116 do_test (0, i, ~len + i, BIG_CHAR);
117 do_test (0, i, ~len - buf_addr - i, BIG_CHAR);
118 do_test (0, i, ~len - buf_addr + i, BIG_CHAR);
119
120 do_test (0, i, -buf_addr, BIG_CHAR);
121 do_test (0, i, j - buf_addr, BIG_CHAR);
122 do_test (0, i, -buf_addr - j, BIG_CHAR);
123 }
124 }
125 }
126
127 static void
do_random_tests(void)128 do_random_tests (void)
129 {
130 size_t i, j, n, align, len;
131 CHAR *p = (CHAR *) (buf1 + page_size - 512 * sizeof (CHAR));
132
133 for (n = 0; n < ITERATIONS; n++)
134 {
135 align = random () & 15;
136 len = random () & 511;
137 if (len + align > 510)
138 len = 511 - align - (random () & 7);
139 j = len + align + 64;
140 if (j > 512)
141 j = 512;
142
143 for (i = 0; i < j; i++)
144 {
145 if (i == len + align)
146 p[i] = 0;
147 else
148 {
149 p[i] = random () & 255;
150 if (i >= align && i < len + align && !p[i])
151 p[i] = (random () & 127) + 1;
152 }
153 }
154
155 FOR_EACH_IMPL (impl, 1)
156 {
157 if (len > 0
158 && CALL (impl, (CHAR *) (p + align), len - 1) != len - 1)
159 {
160 error (0, 0, "Iteration %zd (limited) - wrong result in function %s (%zd) %zd != %zd, p %p",
161 n, impl->name, align,
162 CALL (impl, (CHAR *) (p + align), len - 1), len - 1, p);
163 ret = 1;
164 }
165 if (CALL (impl, (CHAR *) (p + align), len) != len)
166 {
167 error (0, 0, "Iteration %zd (exact) - wrong result in function %s (%zd) %zd != %zd, p %p",
168 n, impl->name, align,
169 CALL (impl, (CHAR *) (p + align), len), len, p);
170 ret = 1;
171 }
172 if (CALL (impl, (CHAR *) (p + align), len + 1) != len)
173 {
174 error (0, 0, "Iteration %zd (long) - wrong result in function %s (%zd) %zd != %zd, p %p",
175 n, impl->name, align,
176 CALL (impl, (CHAR *) (p + align), len + 1), len, p);
177 ret = 1;
178 }
179 }
180 }
181 }
182
183 /* Tests meant to unveil fail on implementation that does not access bytes
184 around the page boundary accordingly. */
185 static void
do_page_tests(void)186 do_page_tests (void)
187 {
188 size_t i, exp_len, start_offset, offset;
189 /* Calculate the null character offset. */
190 size_t last_offset = (page_size / sizeof (CHAR)) - 1;
191
192 CHAR *s = (CHAR *) buf2;
193 MEMSET (s, 65, (last_offset - 1));
194 s[last_offset] = 0;
195
196 /* Place short strings ending at page boundary. */
197 offset = last_offset;
198 for (i = 0; i < 128; i++)
199 {
200 /* Decrease offset to stress several sizes and alignments. */
201 offset--;
202 exp_len = last_offset - offset;
203 FOR_EACH_IMPL (impl, 0)
204 {
205 /* Varies maxlen value to cover the cases where it is:
206 - larger than length;
207 - slightly greater than length;
208 - equal to length;
209 - slightly less than length. */
210 do_one_test (impl, (CHAR *) (s + offset), page_size, exp_len);
211 do_one_test (impl, (CHAR *) (s + offset), exp_len + 1, exp_len);
212 do_one_test (impl, (CHAR *) (s + offset), exp_len, exp_len);
213 if (exp_len > 0)
214 do_one_test (impl, (CHAR *) (s + offset), exp_len - 1, exp_len - 1);
215 }
216 }
217
218 /* Place long strings ending at page boundary. */
219 start_offset = (last_offset + 1) / 2;
220 for (i = 0; i < 64; ++i)
221 {
222 /* Increase offset to stress several alignments. */
223 offset = start_offset + i;
224 if (offset >= (last_offset + 1))
225 break;
226 exp_len = last_offset - offset;
227 FOR_EACH_IMPL (impl, 0)
228 {
229 /* Checks only for maxlen much larger than length because smaller
230 values are already covered in do_random_tests function. */
231 do_one_test (impl, (CHAR *) (s + offset), page_size, exp_len);
232 }
233 }
234 }
235
236 /* Tests meant to unveil fail on implementations that access bytes
237 beyond the maxium length. */
238
239 static void
do_page_2_tests(void)240 do_page_2_tests (void)
241 {
242 size_t i, exp_len, offset;
243 size_t last_offset = page_size / sizeof (CHAR);
244
245 CHAR *s = (CHAR *) buf2;
246 MEMSET (s, 65, last_offset);
247
248 /* Place short strings ending at page boundary without the null
249 byte. */
250 offset = last_offset;
251 for (i = 0; i < 128; i++)
252 {
253 /* Decrease offset to stress several sizes and alignments. */
254 offset--;
255 exp_len = last_offset - offset;
256 FOR_EACH_IMPL (impl, 0)
257 {
258 /* If an implementation goes beyond EXP_LEN, it will trigger
259 the segfault. */
260 do_one_test (impl, (CHAR *) (s + offset), exp_len, exp_len);
261 }
262 }
263 }
264
265 int
test_main(void)266 test_main (void)
267 {
268 size_t i, length, char_per_page;
269
270 test_init ();
271
272 printf ("%20s", "");
273 FOR_EACH_IMPL (impl, 0)
274 printf ("\t%s", impl->name);
275 putchar ('\n');
276
277 for (i = 1; i < 8; ++i)
278 {
279 do_test (0, i, i - 1, MIDDLE_CHAR);
280 do_test (0, i, i, MIDDLE_CHAR);
281 do_test (0, i, i + 1, MIDDLE_CHAR);
282 }
283
284 for (i = 1; i < 8; ++i)
285 {
286 do_test (i, i, i - 1, MIDDLE_CHAR);
287 do_test (i, i, i, MIDDLE_CHAR);
288 do_test (i, i, i + 1, MIDDLE_CHAR);
289 }
290
291 for (i = 2; i <= 10; ++i)
292 {
293 do_test (0, 1 << i, 5000, MIDDLE_CHAR);
294 do_test (1, 1 << i, 5000, MIDDLE_CHAR);
295 }
296
297 for (i = 1; i < 8; ++i)
298 do_test (0, i, 5000, BIG_CHAR);
299
300 for (i = 1; i < 8; ++i)
301 do_test (i, i, 5000, BIG_CHAR);
302
303 for (i = 2; i <= 10; ++i)
304 {
305 do_test (0, 1 << i, 5000, BIG_CHAR);
306 do_test (1, 1 << i, 5000, BIG_CHAR);
307 }
308
309 char_per_page = getpagesize () / sizeof (CHAR);
310
311 for (i = 0; i <= 127; i++)
312 for (length = i; length <= 512; length++)
313 {
314 do_test (i, length, 512, BIG_CHAR);
315 do_test (char_per_page - i, length, 512, BIG_CHAR);
316 }
317
318 do_random_tests ();
319 do_page_tests ();
320 do_page_2_tests ();
321 do_overflow_tests ();
322 return ret;
323 }
324
325 #include <support/test-driver.c>
326