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
|
/* SPDX-License-Identifier: GPL-2.0-or-later */
/*
* Copyright (C) 2015 Anshuman Khandual, IBM Corporation.
*/
#define GPR_1 1
#define GPR_2 2
#define GPR_3 3
#define GPR_4 4
#define FPR_1 0.001
#define FPR_2 0.002
#define FPR_3 0.003
#define FPR_4 0.004
#define FPR_1_REP 0x3f50624dd2f1a9fcull
#define FPR_2_REP 0x3f60624dd2f1a9fcull
#define FPR_3_REP 0x3f689374bc6a7efaull
#define FPR_4_REP 0x3f70624dd2f1a9fcull
/* Buffer must have 18 elements */
int validate_gpr(unsigned long *gpr, unsigned long val)
{
int i, found = 1;
for (i = 0; i < 18; i++) {
if (gpr[i] != val) {
printf("GPR[%d]: %lx Expected: %lx\n",
i+14, gpr[i], val);
found = 0;
}
}
if (!found)
return TEST_FAIL;
return TEST_PASS;
}
/* Buffer must have 32 elements */
int validate_fpr(__u64 *fpr, __u64 val)
{
int i, found = 1;
for (i = 0; i < 32; i++) {
if (fpr[i] != val) {
printf("FPR[%d]: %llx Expected: %llx\n", i, fpr[i], val);
found = 0;
}
}
if (!found)
return TEST_FAIL;
return TEST_PASS;
}
/* Buffer must have 32 elements */
int validate_fpr_double(double *fpr, double val)
{
int i, found = 1;
for (i = 0; i < 32; i++) {
if (fpr[i] != val) {
printf("FPR[%d]: %f Expected: %f\n", i, fpr[i], val);
found = 0;
}
}
if (!found)
return TEST_FAIL;
return TEST_PASS;
}
|
