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
|
/*
* memmove test.
*
* Copyright (c) 2019-2020, Arm Limited.
* SPDX-License-Identifier: MIT
*/
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "mte.h"
#include "stringlib.h"
#include "stringtest.h"
#define F(x, mte) {#x, x, mte},
static const struct fun
{
const char *name;
void *(*fun) (void *, const void *, size_t);
int test_mte;
} funtab[] = {
// clang-format off
F(memmove, 0)
#if __aarch64__
F(__memmove_aarch64, 1)
# if __ARM_NEON
F(__memmove_aarch64_simd, 1)
# endif
# if __ARM_FEATURE_SVE
F(__memmove_aarch64_sve, 1)
# endif
#endif
{0, 0, 0}
// clang-format on
};
#undef F
#define A 32
#define LEN 250000
static unsigned char *dbuf;
static unsigned char *sbuf;
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 (err_count >= ERR_LIMIT)
return;
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);
quoteat ("got", dst, len + A, i);
quoteat ("want", want, len + A, i);
break;
}
}
}
static void
test_overlap (const struct fun *fun, int dalign, int salign, int len)
{
unsigned char *src = alignup (sbuf);
unsigned char *dst = src;
unsigned char *want = wbuf;
unsigned char *s = src + salign;
unsigned char *d = dst + dalign;
unsigned char *w = wbuf + dalign;
void *p;
if (err_count >= ERR_LIMIT)
return;
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] = want[salign + i] = 'a' + i % 23;
for (int i = 0; i < len; i++)
w[i] = s[i];
s = tag_buffer (s, len, fun->test_mte);
d = tag_buffer (d, len, fun->test_mte);
p = fun->fun (d, s, len);
untag_buffer (s, len, fun->test_mte);
untag_buffer (d, len, fun->test_mte);
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);
quoteat ("got", dst, len + A, i);
quoteat ("want", want, len + A, i);
break;
}
}
}
int
main ()
{
dbuf = mte_mmap (LEN + 2 * A);
sbuf = mte_mmap (LEN + 2 * A);
int r = 0;
for (int i = 0; funtab[i].name; i++)
{
err_count = 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);
}
}
char *pass = funtab[i].test_mte && mte_enabled () ? "MTE PASS" : "PASS";
printf ("%s %s\n", err_count ? "FAIL" : pass, funtab[i].name);
if (err_count)
r = -1;
}
return r;
}
|
