forked from quickwritereader/blas-tests
-
Notifications
You must be signed in to change notification settings - Fork 0
/
axpy.c
138 lines (106 loc) · 3.02 KB
/
axpy.c
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
#include <bl_test.h>
#undef AXPY
#ifdef COMPLEX
#ifdef DOUBLE
#define AXPY BLASFUNC(zaxpy)
#else
#define AXPY BLASFUNC(caxpy)
#endif
#else
#ifdef DOUBLE
#define AXPY BLASFUNC(daxpy)
#else
#define AXPY BLASFUNC(saxpy)
#endif
#endif
int main(int argc, char *argv[]) {
FLOAT *x, *y, *nx, *ny;
;
FLOAT alpha[2] = {2.0, 2.0};
blasint m, i;
blasint inc_x = 1, inc_y = 1;
char *p;
int zcase = 0;
#ifdef COMPLEX
//real zero, image zero, both zero, both random
const char *case_names[] = {"r_zero", "i_zero", "both zero", "both random"};
int zero_case[] = {1, 2, 3, 0};
#else
//zero, random
const char *case_names[] = {"zero", "random"};
int zero_case[] = {1, 0};
#endif
int from = 1;
int to = 200;
int step = 1;
argc--;
argv++;
if (argc > 0) {
from = atol(*argv);
argc--;
argv++;
}
if (argc > 0) {
to = MAX(atol(*argv), from);
argc--;
argv++;
}
if (argc > 0) {
step = atol(*argv);
argc--;
argv++;
}
if ((p = getenv("OPENBLAS_INCX"))) inc_x = atoi(p);
if ((p = getenv("OPENBLAS_INCY"))) inc_y = atoi(p);
LOG( "From : %3d To : %3d Step = %3d Inc_x = %d Inc_y = %d \n", from, to, step, inc_x, inc_y);
if ((x = (FLOAT *) malloc(sizeof (FLOAT) * to * abs(inc_x) * COMPSIZE)) == NULL) {
LOG( "Out of Memory!!\n");
exit(1);
}
if ((y = (FLOAT *) malloc(sizeof (FLOAT) * to * abs(inc_y) * COMPSIZE)) == NULL) {
LOG( "Out of Memory!!\n");
exit(1);
}
if ((nx = (FLOAT *) malloc(sizeof (FLOAT) * to * abs(inc_x) * COMPSIZE)) == NULL) {
LOG( "Out of Memory!!\n");
exit(1);
}
if ((ny = (FLOAT *) malloc(sizeof (FLOAT) * to * abs(inc_y) * COMPSIZE)) == NULL) {
LOG( "Out of Memory!!\n");
exit(1);
}
#ifdef linux
srandom(getpid());
#endif
for (m = from; m <= to; m += step) {
for (zcase = 0; zcase<sizeof (zero_case) / sizeof (int); zcase++) {
int casex = zero_case[zcase];
LOG( " %6d %s alpha: \n", (int) m, case_names[zcase]);
alpha[0] = ((FLOAT) rand() / (FLOAT) RAND_MAX) - 0.5;
alpha[1] = ((FLOAT) rand() / (FLOAT) RAND_MAX) - 0.5;
if ((casex & 1) == 1) {
alpha[0] = 0;
}
if ((casex & 2) == 2) {
alpha[1] = 0;
}
for (i = 0; i < m * COMPSIZE * abs(inc_x); i++) {
x[i] = ((FLOAT) rand() / (FLOAT) RAND_MAX) - 0.5;
nx[i] = x[i];
}
for (i = 0; i < m * COMPSIZE * abs(inc_y); i++) {
y[i] = ((FLOAT) rand() / (FLOAT) RAND_MAX) - 0.5;
ny[i] = y[i];
}
AXPY(&m, alpha, x, &inc_x, y, &inc_y);
ref_axpy(m, alpha, nx, inc_x, ny, inc_y);
compare_vals(m, y, inc_y, ny, inc_y, STRINGIZE(AXPY));
}
LOG( "------------\n");
}
free(x);
free(nx);
free(y);
free(ny);
return 0;
}