1*412f47f9SXin Li /*
2*412f47f9SXin Li * memmove test.
3*412f47f9SXin Li *
4*412f47f9SXin Li * Copyright (c) 2019-2023, Arm Limited.
5*412f47f9SXin Li * SPDX-License-Identifier: MIT OR Apache-2.0 WITH LLVM-exception
6*412f47f9SXin Li */
7*412f47f9SXin Li
8*412f47f9SXin Li #include <stdint.h>
9*412f47f9SXin Li #include <stdio.h>
10*412f47f9SXin Li #include <stdlib.h>
11*412f47f9SXin Li #include <string.h>
12*412f47f9SXin Li #include "mte.h"
13*412f47f9SXin Li #include "stringlib.h"
14*412f47f9SXin Li #include "stringtest.h"
15*412f47f9SXin Li
16*412f47f9SXin Li #define F(x, mte) {#x, x, mte},
17*412f47f9SXin Li
18*412f47f9SXin Li static const struct fun
19*412f47f9SXin Li {
20*412f47f9SXin Li const char *name;
21*412f47f9SXin Li void *(*fun) (void *, const void *, size_t);
22*412f47f9SXin Li int test_mte;
23*412f47f9SXin Li } funtab[] = {
24*412f47f9SXin Li // clang-format off
25*412f47f9SXin Li F(memmove, 0)
26*412f47f9SXin Li #if __aarch64__
27*412f47f9SXin Li F(__memmove_aarch64, 1)
28*412f47f9SXin Li # if __ARM_NEON
29*412f47f9SXin Li F(__memmove_aarch64_simd, 1)
30*412f47f9SXin Li # endif
31*412f47f9SXin Li # if __ARM_FEATURE_SVE
32*412f47f9SXin Li F(__memmove_aarch64_sve, 1)
33*412f47f9SXin Li # endif
34*412f47f9SXin Li # if WANT_MOPS
35*412f47f9SXin Li F(__memmove_aarch64_mops, 1)
36*412f47f9SXin Li # endif
37*412f47f9SXin Li #endif
38*412f47f9SXin Li {0, 0, 0}
39*412f47f9SXin Li // clang-format on
40*412f47f9SXin Li };
41*412f47f9SXin Li #undef F
42*412f47f9SXin Li
43*412f47f9SXin Li #define A 32
44*412f47f9SXin Li #define LEN 250000
45*412f47f9SXin Li static unsigned char *dbuf;
46*412f47f9SXin Li static unsigned char *sbuf;
47*412f47f9SXin Li static unsigned char wbuf[LEN + 2 * A];
48*412f47f9SXin Li
49*412f47f9SXin Li static void *
alignup(void * p)50*412f47f9SXin Li alignup (void *p)
51*412f47f9SXin Li {
52*412f47f9SXin Li return (void *) (((uintptr_t) p + A - 1) & -A);
53*412f47f9SXin Li }
54*412f47f9SXin Li
55*412f47f9SXin Li static void
test(const struct fun * fun,int dalign,int salign,int len)56*412f47f9SXin Li test (const struct fun *fun, int dalign, int salign, int len)
57*412f47f9SXin Li {
58*412f47f9SXin Li unsigned char *src = alignup (sbuf);
59*412f47f9SXin Li unsigned char *dst = alignup (dbuf);
60*412f47f9SXin Li unsigned char *want = wbuf;
61*412f47f9SXin Li unsigned char *s = src + salign;
62*412f47f9SXin Li unsigned char *d = dst + dalign;
63*412f47f9SXin Li unsigned char *w = want + dalign;
64*412f47f9SXin Li void *p;
65*412f47f9SXin Li int i;
66*412f47f9SXin Li
67*412f47f9SXin Li if (err_count >= ERR_LIMIT)
68*412f47f9SXin Li return;
69*412f47f9SXin Li if (len > LEN || dalign >= A || salign >= A)
70*412f47f9SXin Li abort ();
71*412f47f9SXin Li for (i = 0; i < len + A; i++)
72*412f47f9SXin Li {
73*412f47f9SXin Li src[i] = '?';
74*412f47f9SXin Li want[i] = dst[i] = '*';
75*412f47f9SXin Li }
76*412f47f9SXin Li for (i = 0; i < len; i++)
77*412f47f9SXin Li s[i] = w[i] = 'a' + i % 23;
78*412f47f9SXin Li
79*412f47f9SXin Li p = fun->fun (d, s, len);
80*412f47f9SXin Li if (p != d)
81*412f47f9SXin Li ERR ("%s(%p,..) returned %p\n", fun->name, d, p);
82*412f47f9SXin Li for (i = 0; i < len + A; i++)
83*412f47f9SXin Li {
84*412f47f9SXin Li if (dst[i] != want[i])
85*412f47f9SXin Li {
86*412f47f9SXin Li ERR ("%s(align %d, align %d, %d) failed\n", fun->name, dalign, salign,
87*412f47f9SXin Li len);
88*412f47f9SXin Li quoteat ("got", dst, len + A, i);
89*412f47f9SXin Li quoteat ("want", want, len + A, i);
90*412f47f9SXin Li break;
91*412f47f9SXin Li }
92*412f47f9SXin Li }
93*412f47f9SXin Li }
94*412f47f9SXin Li
95*412f47f9SXin Li static void
test_overlap(const struct fun * fun,int dalign,int salign,int len)96*412f47f9SXin Li test_overlap (const struct fun *fun, int dalign, int salign, int len)
97*412f47f9SXin Li {
98*412f47f9SXin Li unsigned char *src = alignup (sbuf);
99*412f47f9SXin Li unsigned char *dst = src;
100*412f47f9SXin Li unsigned char *want = wbuf;
101*412f47f9SXin Li unsigned char *s = src + salign;
102*412f47f9SXin Li unsigned char *d = dst + dalign;
103*412f47f9SXin Li unsigned char *w = wbuf + dalign;
104*412f47f9SXin Li void *p;
105*412f47f9SXin Li
106*412f47f9SXin Li if (err_count >= ERR_LIMIT)
107*412f47f9SXin Li return;
108*412f47f9SXin Li if (len > LEN || dalign >= A || salign >= A)
109*412f47f9SXin Li abort ();
110*412f47f9SXin Li
111*412f47f9SXin Li for (int i = 0; i < len + A; i++)
112*412f47f9SXin Li src[i] = want[i] = '?';
113*412f47f9SXin Li
114*412f47f9SXin Li for (int i = 0; i < len; i++)
115*412f47f9SXin Li s[i] = want[salign + i] = 'a' + i % 23;
116*412f47f9SXin Li for (int i = 0; i < len; i++)
117*412f47f9SXin Li w[i] = s[i];
118*412f47f9SXin Li
119*412f47f9SXin Li s = tag_buffer (s, len, fun->test_mte);
120*412f47f9SXin Li d = tag_buffer (d, len, fun->test_mte);
121*412f47f9SXin Li p = fun->fun (d, s, len);
122*412f47f9SXin Li untag_buffer (s, len, fun->test_mte);
123*412f47f9SXin Li untag_buffer (d, len, fun->test_mte);
124*412f47f9SXin Li
125*412f47f9SXin Li if (p != d)
126*412f47f9SXin Li ERR ("%s(%p,..) returned %p\n", fun->name, d, p);
127*412f47f9SXin Li for (int i = 0; i < len + A; i++)
128*412f47f9SXin Li {
129*412f47f9SXin Li if (dst[i] != want[i])
130*412f47f9SXin Li {
131*412f47f9SXin Li ERR ("%s(align %d, align %d, %d) failed\n", fun->name, dalign, salign,
132*412f47f9SXin Li len);
133*412f47f9SXin Li quoteat ("got", dst, len + A, i);
134*412f47f9SXin Li quoteat ("want", want, len + A, i);
135*412f47f9SXin Li break;
136*412f47f9SXin Li }
137*412f47f9SXin Li }
138*412f47f9SXin Li }
139*412f47f9SXin Li
140*412f47f9SXin Li int
main()141*412f47f9SXin Li main ()
142*412f47f9SXin Li {
143*412f47f9SXin Li dbuf = mte_mmap (LEN + 2 * A);
144*412f47f9SXin Li sbuf = mte_mmap (LEN + 2 * A);
145*412f47f9SXin Li int r = 0;
146*412f47f9SXin Li for (int i = 0; funtab[i].name; i++)
147*412f47f9SXin Li {
148*412f47f9SXin Li err_count = 0;
149*412f47f9SXin Li for (int d = 0; d < A; d++)
150*412f47f9SXin Li for (int s = 0; s < A; s++)
151*412f47f9SXin Li {
152*412f47f9SXin Li int n;
153*412f47f9SXin Li for (n = 0; n < 100; n++)
154*412f47f9SXin Li {
155*412f47f9SXin Li test (funtab + i, d, s, n);
156*412f47f9SXin Li test_overlap (funtab + i, d, s, n);
157*412f47f9SXin Li }
158*412f47f9SXin Li for (; n < LEN; n *= 2)
159*412f47f9SXin Li {
160*412f47f9SXin Li test (funtab + i, d, s, n);
161*412f47f9SXin Li test_overlap (funtab + i, d, s, n);
162*412f47f9SXin Li }
163*412f47f9SXin Li }
164*412f47f9SXin Li char *pass = funtab[i].test_mte && mte_enabled () ? "MTE PASS" : "PASS";
165*412f47f9SXin Li printf ("%s %s\n", err_count ? "FAIL" : pass, funtab[i].name);
166*412f47f9SXin Li if (err_count)
167*412f47f9SXin Li r = -1;
168*412f47f9SXin Li }
169*412f47f9SXin Li return r;
170*412f47f9SXin Li }
171