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
|
/*
* strcmp test.
*
* Copyright (c) 2019, Arm Limited.
* SPDX-License-Identifier: MIT
*/
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "stringlib.h"
#include "stringtest.h"
static const struct fun
{
const char *name;
int (*fun)(const char *s1, const char *s2);
} funtab[] = {
#define F(x) {#x, x},
F(strcmp)
#if __aarch64__
F(__strcmp_aarch64)
F(__strcmp_aarch64_mte)
# if __ARM_FEATURE_SVE
F(__strcmp_aarch64_sve)
# endif
#elif __arm__
# if __ARM_ARCH >= 7 && __ARM_ARCH_ISA_ARM >= 1
F(__strcmp_arm)
# elif __ARM_ARCH == 6 && __ARM_ARCH_6M__ >= 1
F(__strcmp_armv6m)
# endif
#endif
#undef F
{0, 0}
};
#define A 32
#define LEN 250000
static char s1buf[LEN+2*A+1];
static char s2buf[LEN+2*A+1];
static void *alignup(void *p)
{
return (void*)(((uintptr_t)p + A-1) & -A);
}
static void test(const struct fun *fun, int s1align, int s2align, int len, int diffpos, int delta)
{
char *src1 = alignup(s1buf);
char *src2 = alignup(s2buf);
char *s1 = src1 + s1align;
char *s2 = src2 + s2align;
int r;
if (err_count >= ERR_LIMIT)
return;
if (len > LEN || s1align >= A || s2align >= A)
abort();
if (diffpos >= len)
abort();
if ((diffpos < 0) != (delta == 0))
abort();
for (int i = 0; i < len+A; i++)
src1[i] = src2[i] = '?';
for (int i = 0; i < len; i++)
s1[i] = s2[i] = 'a' + i%23;
if (delta)
s1[diffpos] += delta;
s1[len] = s2[len] = '\0';
r = fun->fun(s1, s2);
if ((delta == 0 && r != 0) || (delta > 0 && r <= 0) || (delta < 0 && r >= 0)) {
ERR("%s(align %d, align %d, %d) failed, returned %d\n",
fun->name, s1align, s2align, len, r);
quoteat("src1", src1, len+A, diffpos);
quoteat("src2", src2, len+A, diffpos);
}
}
int main()
{
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;
test(funtab+i, d, s, 0, -1, 0);
test(funtab+i, d, s, 1, -1, 0);
test(funtab+i, d, s, 1, 0, 1);
test(funtab+i, d, s, 1, 0, -1);
for (n = 2; n < 100; n++) {
test(funtab+i, d, s, n, -1, 0);
test(funtab+i, d, s, n, n - 1, -1);
test(funtab+i, d, s, n, n / 2, 1);
}
for (; n < LEN; n *= 2) {
test(funtab+i, d, s, n, -1, 0);
test(funtab+i, d, s, n, n / 2, -1);
}
}
printf("%s %s\n", err_count ? "FAIL" : "PASS", funtab[i].name);
if (err_count)
r = -1;
}
return r;
}
|
