1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
|
/* Test and measure memmove functions.
Copyright (C) 1999-2022 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, see
<https://www.gnu.org/licenses/>. */
#define TEST_MAIN
#ifdef TEST_BCOPY
# define TEST_NAME "bcopy"
#else
# define TEST_NAME "memmove"
#endif
#include "test-string.h"
#include <support/test-driver.h>
char *simple_memmove (char *, const char *, size_t);
#ifdef TEST_BCOPY
typedef void (*proto_t) (const char *, char *, size_t);
IMPL (bcopy, 1)
/* Naive implementation to verify results. */
void
simple_bcopy (const char *src, char *dst, size_t n)
{
simple_memmove (dst, src, n);
}
#else
typedef char *(*proto_t) (char *, const char *, size_t);
IMPL (memmove, 1)
#endif
/* Naive implementation to verify results. */
char *
inhibit_loop_to_libcall
simple_memmove (char *dst, const char *src, size_t n)
{
char *ret = dst;
if (src < dst)
{
dst += n;
src += n;
while (n--)
*--dst = *--src;
}
else
while (n--)
*dst++ = *src++;
return ret;
}
static void
do_one_test (impl_t *impl, char *dst, char *src, const char *orig_src,
size_t len)
{
/* This also clears the destination buffer set by the previous run. */
memcpy (src, orig_src, len);
#ifdef TEST_BCOPY
CALL (impl, src, dst, len);
#else
char *res;
res = CALL (impl, dst, src, len);
if (res != dst)
{
error (0, 0, "Wrong result in function %s %p %p", impl->name,
res, dst);
ret = 1;
return;
}
#endif
if (memcmp (dst, orig_src, len) != 0)
{
error (0, 0, "Wrong result in function %s dst \"%s\" src \"%s\"",
impl->name, dst, src);
ret = 1;
return;
}
}
static void
do_test (size_t align1, size_t align2, size_t len)
{
size_t i, j;
char *s1, *s2;
align1 &= (getpagesize() - 1);
if (align1 + len >= page_size)
return;
align2 &= (getpagesize() - 1);
if (align2 + len >= page_size)
return;
s1 = (char *) (buf1 + align1);
s2 = (char *) (buf2 + align2);
for (i = 0, j = 1; i < len; i++, j += 23)
s1[i] = j;
FOR_EACH_IMPL (impl, 0)
do_one_test (impl, s2, (char *) (buf2 + align1), s1, len);
}
static void
do_random_tests (void)
{
size_t i, n, align1, align2, len, size;
size_t srcstart, srcend, dststart, dstend;
int c;
unsigned char *p1, *p2;
#ifndef TEST_BCOPY
unsigned char *res;
#endif
for (n = 0; n < ITERATIONS; n++)
{
if ((random () & 255) == 0)
size = 65536;
else
size = 512;
if (size > page_size)
size = page_size;
if ((random () & 3) == 0)
{
len = random () & (size - 1);
align1 = size - len - (random () & 31);
align2 = size - len - (random () & 31);
if (align1 > size)
align1 = 0;
if (align2 > size)
align2 = 0;
}
else
{
align1 = random () & (size / 2 - 1);
align2 = random () & (size / 2 - 1);
len = random () & (size - 1);
if (align1 + len > size)
align1 = size - len;
if (align2 + len > size)
align2 = size - len;
}
p1 = buf1 + page_size - size;
p2 = buf2 + page_size - size;
c = random () & 255;
srcend = align1 + len + 256;
if (srcend > size)
srcend = size;
if (align1 > 256)
srcstart = align1 - 256;
else
srcstart = 0;
for (i = srcstart; i < srcend; ++i)
p1[i] = random () & 255;
dstend = align2 + len + 256;
if (dstend > size)
dstend = size;
if (align2 > 256)
dststart = align2 - 256;
else
dststart = 0;
FOR_EACH_IMPL (impl, 1)
{
memset (p2 + dststart, c, dstend - dststart);
memcpy (p2 + srcstart, p1 + srcstart, srcend - srcstart);
#ifdef TEST_BCOPY
CALL (impl, (char *) (p2 + align1), (char *) (p2 + align2), len);
#else
res = (unsigned char *) CALL (impl,
(char *) (p2 + align2),
(char *) (p2 + align1), len);
if (res != p2 + align2)
{
error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %zd, %zd) %p != %p",
n, impl->name, align1, align2, len, res, p2 + align2);
ret = 1;
}
#endif
if (memcmp (p1 + align1, p2 + align2, len))
{
error (0, 0, "Iteration %zd - different strings, %s (%zd, %zd, %zd)",
n, impl->name, align1, align2, len);
ret = 1;
}
for (i = dststart; i < dstend; ++i)
{
if (i >= align2 && i < align2 + len)
{
i = align2 + len - 1;
continue;
}
if (i >= srcstart && i < srcend)
{
i = srcend - 1;
continue;
}
if (p2[i] != c)
{
error (0, 0, "Iteration %zd - garbage in memset area, %s (%zd, %zd, %zd)",
n, impl->name, align1, align2, len);
ret = 1;
break;
}
}
if (srcstart < align2
&& memcmp (p2 + srcstart, p1 + srcstart,
(srcend > align2 ? align2 : srcend) - srcstart))
{
error (0, 0, "Iteration %zd - garbage before dst, %s (%zd, %zd, %zd)",
n, impl->name, align1, align2, len);
ret = 1;
break;
}
i = srcstart > align2 + len ? srcstart : align2 + len;
if (srcend > align2 + len
&& memcmp (p2 + i, p1 + i, srcend - i))
{
error (0, 0, "Iteration %zd - garbage after dst, %s (%zd, %zd, %zd)",
n, impl->name, align1, align2, len);
ret = 1;
break;
}
}
}
}
static void
do_test2 (size_t offset)
{
size_t size = 0x20000000;
uint32_t * large_buf;
large_buf = mmap ((void*) 0x70000000, size, PROT_READ | PROT_WRITE,
MAP_PRIVATE | MAP_ANON, -1, 0);
if (large_buf == MAP_FAILED)
error (EXIT_UNSUPPORTED, errno, "Large mmap failed");
if ((uintptr_t) large_buf > 0x80000000 - 128
|| 0x80000000 - (uintptr_t) large_buf > 0x20000000)
{
error (0, 0, "Large mmap allocated improperly");
ret = EXIT_UNSUPPORTED;
munmap ((void *) large_buf, size);
return;
}
size_t bytes_move = 0x80000000 - (uintptr_t) large_buf;
if (bytes_move + offset * sizeof (uint32_t) > size)
{
munmap ((void *) large_buf, size);
return;
}
size_t arr_size = bytes_move / sizeof (uint32_t);
size_t i;
size_t repeats;
uint32_t * src = large_buf;
uint32_t * dst = &large_buf[offset];
for (repeats = 0; repeats < 2; ++repeats)
{
FOR_EACH_IMPL (impl, 0)
{
for (i = 0; i < arr_size; i++)
src[i] = (uint32_t) i;
#ifdef TEST_BCOPY
CALL (impl, (char *) src, (char *) dst, bytes_move);
#else
CALL (impl, (char *) dst, (char *) src, bytes_move);
#endif
for (i = 0; i < arr_size; i++)
{
if (dst[i] != (uint32_t) i)
{
error (0, 0,
"Wrong result in function %s dst \"%p\" src \"%p\" offset \"%zd\"",
impl->name, dst, src, i);
ret = 1;
munmap ((void *) large_buf, size);
return;
}
}
}
src = dst;
dst = large_buf;
}
munmap ((void *) large_buf, size);
}
static void
do_test3 (size_t bytes_move, size_t offset)
{
size_t size = bytes_move * 3;
uint32_t *buf;
buf = mmap (NULL, size, PROT_READ | PROT_WRITE,
MAP_PRIVATE | MAP_ANON, -1, 0);
if (buf == MAP_FAILED)
error (EXIT_UNSUPPORTED, errno, "mmap failed");
size_t arr_size = bytes_move / sizeof (uint32_t);
size_t i;
FOR_EACH_IMPL (impl, 0)
{
for (i = 0; i < arr_size; i++)
buf[i] = (uint32_t) i;
uint32_t *dst = &buf[arr_size + offset];
#ifdef TEST_BCOPY
CALL (impl, (char *) buf, (char *) dst, bytes_move);
#else
CALL (impl, (char *) dst, (char *) buf, bytes_move);
#endif
for (i = 0; i < arr_size; i++)
{
if (dst[i] != (uint32_t) i)
{
error (0, 0,
"Wrong result in function %s dst \"%p\" src \"%p\" offset \"%zd\"",
impl->name, dst, buf, i);
ret = 1;
break;
}
}
}
munmap ((void *) buf, size);
}
static void
do_test4 (size_t bytes_move, size_t offset1, size_t offset2)
{
size_t size, repeats, i;
uint8_t *buf, *dst, *src;
size = bytes_move + MAX(offset1, offset2);
buf = mmap(NULL, size, PROT_READ | PROT_WRITE,
MAP_PRIVATE | MAP_ANON, -1, 0);
if (buf == MAP_FAILED)
error (EXIT_UNSUPPORTED, errno, "mmap failed");
dst = &buf[offset1];
src = &buf[offset2];
for (repeats = 0; repeats < 2; ++repeats)
{
FOR_EACH_IMPL (impl, 0)
{
for (i = 0; i < bytes_move; i++)
src[i] = (uint8_t) i;
#ifdef TEST_BCOPY
CALL (impl, (char *) src, (char *) dst, bytes_move);
#else
CALL (impl, (char *) dst, (char *) src, bytes_move);
#endif
for (i = 0; i < bytes_move; i++)
{
if (dst[i] != (uint8_t) i)
{
error (0, 0,
"Wrong result in function %s dst \"%p\" src \"%p\" offset \"%zd\"",
impl->name, dst, buf, i);
ret = 1;
break;
}
}
}
dst = &buf[offset2];
src = &buf[offset1];
}
munmap ((void *) buf, size);
}
int
test_main (void)
{
size_t i;
test_init ();
printf ("%23s", "");
FOR_EACH_IMPL (impl, 0)
printf ("\t%s", impl->name);
putchar ('\n');
for (i = 0; i < 14; ++i)
{
do_test (0, 32, 1 << i);
do_test (32, 0, 1 << i);
do_test (0, i, 1 << i);
do_test (i, 0, 1 << i);
}
for (i = 0; i < 32; ++i)
{
do_test (0, 32, i);
do_test (32, 0, i);
do_test (0, i, i);
do_test (i, 0, i);
}
for (i = 3; i < 32; ++i)
{
if ((i & (i - 1)) == 0)
continue;
do_test (0, 32, 16 * i);
do_test (32, 0, 16 * i);
do_test (0, i, 16 * i);
do_test (i, 0, 16 * i);
}
do_random_tests ();
do_test2 (0);
do_test2 (33);
do_test2 (0x200000 - 1);
do_test2 (0x200000);
do_test2 (0x200000 + 1);
do_test2 (0x1000000 - 1);
do_test2 (0x1000000);
do_test2 (0x1000000 + 1);
do_test2 (0x4000000 - 1);
do_test2 (0x4000000);
do_test2 (0x4000000 + 1);
/* Copy 16KB data. */
do_test3 (16384, 3);
for (i = 4096; i <= 16384; i <<= 1)
{
do_test4 (i, 0, i);
do_test4 (i, 0, i - 1);
do_test4 (i, 0, i + 1);
do_test4 (i, 63, i + 63);
do_test4 (i, 63, i + 64);
do_test4 (i, 63, i);
do_test4 (i, 0, 1);
do_test4 (i, 0, 15);
do_test4 (i, 0, 31);
do_test4 (i, 0, 63);
do_test4 (i, 0, 64);
do_test4 (i, 0, 65);
do_test4 (i, 0, 127);
do_test4 (i, 0, 129);
}
return ret;
}
#include <support/test-driver.c>
|