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
|
/*
* memmove test.
*
* Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
* See https://llvm.org/LICENSE.txt for license information.
* SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
*/
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "stringlib.h"
static const struct fun
{
const char *name;
void *(*fun)(void *, const void *, size_t);
} funtab[] = {
#define F(x) {#x, x},
F(memmove)
#if __aarch64__
F(__memmove_aarch64)
# if __ARM_NEON
F(__memmove_aarch64_simd)
# endif
#endif
#undef F
{0, 0}
};
static int test_status;
#define ERR(...) (test_status=1, printf(__VA_ARGS__))
#define A 32
#define LEN 250000
static unsigned char dbuf[LEN+2*A];
static unsigned char sbuf[LEN+2*A];
static unsigned char wbuf[LEN+2*A];
static void *alignup(void *p)
{
return (void*)(((uintptr_t)p + A-1) & -A);
}
static void test(const struct fun *fun, int dalign, int salign, int len)
{
unsigned char *src = alignup(sbuf);
unsigned char *dst = alignup(dbuf);
unsigned char *want = wbuf;
unsigned char *s = src + salign;
unsigned char *d = dst + dalign;
unsigned char *w = want + dalign;
void *p;
int i;
if (len > LEN || dalign >= A || salign >= A)
abort();
for (i = 0; i < len+A; i++) {
src[i] = '?';
want[i] = dst[i] = '*';
}
for (i = 0; i < len; i++)
s[i] = w[i] = 'a' + i%23;
p = fun->fun(d, s, len);
if (p != d)
ERR("%s(%p,..) returned %p\n", fun->name, d, p);
for (i = 0; i < len+A; i++) {
if (dst[i] != want[i]) {
ERR("%s(align %d, align %d, %d) failed\n", fun->name, dalign, salign, len);
ERR("got : %.*s\n", dalign+len+1, dst);
ERR("want: %.*s\n", dalign+len+1, want);
break;
}
}
}
static void test_overlap(const struct fun *fun, int dalign, int salign, int len)
{
unsigned char *src = alignup(sbuf);
unsigned char *dst = alignup(sbuf);
unsigned char *want = wbuf;
unsigned char *s = src + salign;
unsigned char *d = dst + dalign;
unsigned char *w = wbuf + dalign;
void *p;
if (len > LEN || dalign >= A || salign >= A)
abort();
for (int i = 0; i < len+A; i++)
src[i] = want[i] = '?';
for (int i = 0; i < len; i++)
s[i] = w[i] = 'a' + i%23;
/* Copy the potential overlap range. */
if (s < d) {
for (int i = 0; i < (uintptr_t)d-(uintptr_t)s; i++)
want[salign+i] = src[salign+i];
} else {
for (int i = 0; i < (uintptr_t)s-(uintptr_t)d; i++)
want[len + dalign + i] = src[len + dalign + i];
}
p = fun->fun(d, s, len);
if (p != d)
ERR("%s(%p,..) returned %p\n", fun->name, d, p);
for (int i = 0; i < len+A; i++) {
if (dst[i] != want[i]) {
ERR("%s(align %d, align %d, %d) failed\n", fun->name, dalign, salign, len);
ERR("got : %.*s\n", dalign+len+1, dst);
ERR("want: %.*s\n", dalign+len+1, want);
abort();
break;
}
}
}
int main()
{
test_overlap(funtab+0, 2, 1, 1);
int r = 0;
for (int i=0; funtab[i].name; i++) {
test_status = 0;
for (int d = 0; d < A; d++)
for (int s = 0; s < A; s++) {
int n;
for (n = 0; n < 100; n++) {
test(funtab+i, d, s, n);
test_overlap(funtab+i, d, s, n);
}
for (; n < LEN; n *= 2) {
test(funtab+i, d, s, n);
test_overlap(funtab+i, d, s, n);
}
}
printf("%s %s\n", test_status ? "FAIL" : "PASS", funtab[i].name);
if (test_status)
r = -1;
}
return r;
}
|
