1/* Test and measure memccpy 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#define TEST_NAME "memccpy"
21#include "test-string.h"
22
23void *simple_memccpy (void *, const void *, int, size_t);
24void *stupid_memccpy (void *, const void *, int, size_t);
25
26IMPL (stupid_memccpy, 0)
27IMPL (simple_memccpy, 0)
28IMPL (memccpy, 1)
29
30void *
31simple_memccpy (void *dst, const void *src, int c, size_t n)
32{
33 const char *s = src;
34 char *d = dst;
35
36 while (n-- > 0)
37 if ((*d++ = *s++) == (char) c)
38 return d;
39
40 return NULL;
41}
42
43void *
44stupid_memccpy (void *dst, const void *src, int c, size_t n)
45{
46 void *p = memchr (src, c, n);
47
48 if (p != NULL)
49 return mempcpy (dst, src, p - src + 1);
50
51 memcpy (dst, src, n);
52 return NULL;
53}
54
55typedef void *(*proto_t) (void *, const void *, int c, size_t);
56
57static void
58do_one_test (impl_t *impl, void *dst, const void *src, int c, size_t len,
59 size_t n)
60{
61 void *expect = len > n ? NULL : (char *) dst + len;
62 if (CALL (impl, dst, src, c, n) != expect)
63 {
64 error (status: 0, errnum: 0, format: "Wrong result in function %s %p %p", impl->name,
65 CALL (impl, dst, src, c, n), expect);
66 ret = 1;
67 return;
68 }
69
70 if (memcmp (dst, src, len > n ? n : len) != 0)
71 {
72 error (status: 0, errnum: 0, format: "Wrong result in function %s", impl->name);
73 ret = 1;
74 return;
75 }
76}
77
78static void
79do_test (size_t align1, size_t align2, int c, size_t len, size_t n,
80 int max_char)
81{
82 size_t i;
83 char *s1, *s2;
84
85 align1 &= 7;
86 if (align1 + len >= page_size)
87 return;
88
89 align2 &= 7;
90 if (align2 + len >= page_size)
91 return;
92
93 s1 = (char *) (buf1 + align1);
94 s2 = (char *) (buf2 + align2);
95
96 for (i = 0; i < len - 1; ++i)
97 {
98 s1[i] = 32 + 23 * i % (max_char - 32);
99 if (s1[i] == (char) c)
100 --s1[i];
101 }
102 s1[len - 1] = c;
103 for (i = len; i + align1 < page_size && i < len + 64; ++i)
104 s1[i] = 32 + 32 * i % (max_char - 32);
105
106 FOR_EACH_IMPL (impl, 0)
107 do_one_test (impl, dst: s2, src: s1, c, len, n);
108}
109
110static void
111do_random_tests (void)
112{
113 size_t i, j, n, align1, align2, len, size, mode;
114 unsigned char *p1 = buf1 + page_size - 512;
115 unsigned char *p2 = buf2 + page_size - 512;
116 unsigned char *res, c;
117
118 for (n = 0; n < ITERATIONS; n++)
119 {
120 mode = random ();
121 c = random ();
122 if (mode & 1)
123 {
124 size = random () & 255;
125 align1 = 512 - size - (random () & 15);
126 if (mode & 2)
127 align2 = align1 - (random () & 24);
128 else
129 align2 = align1 - (random () & 31);
130 if (mode & 4)
131 {
132 j = align1;
133 align1 = align2;
134 align2 = j;
135 }
136 if (mode & 8)
137 len = size - (random () & 31);
138 else
139 len = 512;
140 if (len >= 512)
141 len = random () & 511;
142 }
143 else
144 {
145 align1 = random () & 31;
146 if (mode & 2)
147 align2 = random () & 31;
148 else
149 align2 = align1 + (random () & 24);
150 len = random () & 511;
151 j = align1;
152 if (align2 > j)
153 j = align2;
154 if (mode & 4)
155 {
156 size = random () & 511;
157 if (size + j > 512)
158 size = 512 - j - (random() & 31);
159 }
160 else
161 size = 512 - j;
162 if ((mode & 8) && len + j >= 512)
163 len = 512 - j - (random () & 7);
164 }
165 j = len + align1 + 64;
166 if (j > 512)
167 j = 512;
168 for (i = 0; i < j; i++)
169 {
170 if (i == len + align1)
171 p1[i] = c;
172 else
173 {
174 p1[i] = random () & 255;
175 if (i >= align1 && i < len + align1 && p1[i] == c)
176 p1[i] = (random () & 127) + 3 + c;
177 }
178 }
179
180 FOR_EACH_IMPL (impl, 1)
181 {
182 unsigned char *expect;
183 memset (p2 - 64, '\1', 512 + 64);
184 res = CALL (impl, p2 + align2, p1 + align1, (char) c, size);
185 if (len >= size)
186 expect = NULL;
187 else
188 expect = p2 + align2 + len + 1;
189
190 if (res != expect)
191 {
192 error (status: 0, errnum: 0, format: "Iteration %zd - wrong result in function %s (%zd, %zd, %zd, %zd, %d) %p != %p",
193 n, impl->name, align1, align2, len, size, c, res, expect);
194 ret = 1;
195 }
196 for (j = 0; j < align2 + 64; ++j)
197 {
198 if (p2[j - 64] != '\1')
199 {
200 error (status: 0, errnum: 0, format: "Iteration %zd - garbage before, %s (%zd, %zd, %zd)",
201 n, impl->name, align1, align2, len);
202 ret = 1;
203 break;
204 }
205 }
206 j = align2 + len + 1;
207 if (size + align2 < j)
208 j = size + align2;
209 for (; j < 512; ++j)
210 {
211 if (p2[j] != '\1')
212 {
213 error (status: 0, errnum: 0, format: "Iteration %zd - garbage after, %s (%zd, %zd, %zd)",
214 n, impl->name, align1, align2, len);
215 ret = 1;
216 break;
217 }
218 }
219 j = len + 1;
220 if (size < j)
221 j = size;
222 if (memcmp (p1 + align1, p2 + align2, j))
223 {
224 error (status: 0, errnum: 0, format: "Iteration %zd - different strings, %s (%zd, %zd, %zd)",
225 n, impl->name, align1, align2, len);
226 ret = 1;
227 }
228 }
229 }
230}
231
232int
233test_main (void)
234{
235 size_t i;
236
237 test_init ();
238
239 printf (format: "%28s", "");
240 FOR_EACH_IMPL (impl, 0)
241 printf (format: "\t%s", impl->name);
242 putchar (c: '\n');
243
244 for (i = 1; i < 8; ++i)
245 {
246 do_test (align1: i, align2: i, c: 12, len: 16, n: 16, max_char: 127);
247 do_test (align1: i, align2: i, c: 23, len: 16, n: 16, max_char: 255);
248 do_test (align1: i, align2: 2 * i, c: 28, len: 16, n: 16, max_char: 127);
249 do_test (align1: 2 * i, align2: i, c: 31, len: 16, n: 16, max_char: 255);
250 do_test (align1: 8 - i, align2: 2 * i, c: 1, len: 1 << i, n: 2 << i, max_char: 127);
251 do_test (align1: 2 * i, align2: 8 - i, c: 17, len: 2 << i, n: 1 << i, max_char: 127);
252 do_test (align1: 8 - i, align2: 2 * i, c: 0, len: 1 << i, n: 2 << i, max_char: 255);
253 do_test (align1: 2 * i, align2: 8 - i, c: i, len: 2 << i, n: 1 << i, max_char: 255);
254 }
255
256 for (i = 1; i < 8; ++i)
257 {
258 do_test (align1: 0, align2: 0, c: i, len: 4 << i, n: 8 << i, max_char: 127);
259 do_test (align1: 0, align2: 0, c: i, len: 16 << i, n: 8 << i, max_char: 127);
260 do_test (align1: 8 - i, align2: 2 * i, c: i, len: 4 << i, n: 8 << i, max_char: 127);
261 do_test (align1: 8 - i, align2: 2 * i, c: i, len: 16 << i, n: 8 << i, max_char: 127);
262 }
263
264 do_random_tests ();
265 return ret;
266}
267
268#include <support/test-driver.c>
269

source code of glibc/string/test-memccpy.c