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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
|
/*********************************************************************/
/* Copyright 2009, 2010 The University of Texas at Austin. */
/* All rights reserved. */
/* */
/* Redistribution and use in source and binary forms, with or */
/* without modification, are permitted provided that the following */
/* conditions are met: */
/* */
/* 1. Redistributions of source code must retain the above */
/* copyright notice, this list of conditions and the following */
/* disclaimer. */
/* */
/* 2. Redistributions in binary form must reproduce the above */
/* copyright notice, this list of conditions and the following */
/* disclaimer in the documentation and/or other materials */
/* provided with the distribution. */
/* */
/* THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY OF TEXAS AT */
/* AUSTIN ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, */
/* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF */
/* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE */
/* DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY OF TEXAS AT */
/* AUSTIN OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, */
/* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES */
/* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE */
/* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR */
/* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF */
/* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT */
/* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT */
/* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE */
/* POSSIBILITY OF SUCH DAMAGE. */
/* */
/* The views and conclusions contained in the software and */
/* documentation are those of the authors and should not be */
/* interpreted as representing official policies, either expressed */
/* or implied, of The University of Texas at Austin. */
/*********************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include "common.h"
#include "symcopy.h"
#if! defined(HEMV) && !defined(HEMVREV)
#define MYSYMV_U SYMV_U
#define MYSYMV_L SYMV_L
#elif defined HEMV
#define MYSYMV_U HEMV_U
#define MYSYMV_L HEMV_L
#else
#define MYSYMV_U HEMV_V
#define MYSYMV_L HEMV_M
#endif
static int symv_kernel(blas_arg_t *args, BLASLONG *range_m, BLASLONG *range_n, FLOAT *dummy1, FLOAT *buffer, BLASLONG pos){
FLOAT *a, *x, *y;
BLASLONG lda, incx;
BLASLONG m_from, m_to;
a = (FLOAT *)args -> a;
x = (FLOAT *)args -> b;
y = (FLOAT *)args -> c;
lda = args -> lda;
incx = args -> ldb;
m_from = 0;
m_to = args -> m;
if (range_m) {
m_from = *(range_m + 0);
m_to = *(range_m + 1);
}
if (range_n) y += *range_n * COMPSIZE;
#ifndef LOWER
SCAL_K(m_to, 0, 0, ZERO,
#ifdef COMPLEX
ZERO,
#endif
y, 1, NULL, 0, NULL, 0);
MYSYMV_U (m_to, m_to - m_from, ONE,
#ifdef COMPLEX
ZERO,
#endif
a, lda, x, incx, y, 1, buffer);
#else
SCAL_K(args -> m - m_from, 0, 0, ZERO,
#ifdef COMPLEX
ZERO,
#endif
y + m_from * COMPSIZE, 1, NULL, 0, NULL, 0);
MYSYMV_L (args -> m - m_from, m_to - m_from, ONE,
#ifdef COMPLEX
ZERO,
#endif
a + m_from * (lda + 1) * COMPSIZE, lda, x + m_from * incx * COMPSIZE, incx, y + m_from * COMPSIZE, 1, buffer);
#endif
return 0;
}
#ifndef COMPLEX
int CNAME(BLASLONG m, FLOAT alpha, FLOAT *a, BLASLONG lda, FLOAT *x, BLASLONG incx, FLOAT *y, BLASLONG incy, FLOAT *buffer, int nthreads){
#else
int CNAME(BLASLONG m, FLOAT *alpha, FLOAT *a, BLASLONG lda, FLOAT *x, BLASLONG incx, FLOAT *y, BLASLONG incy, FLOAT *buffer, int nthreads){
#endif
blas_arg_t args;
blas_queue_t queue[MAX_CPU_NUMBER];
BLASLONG range_m[MAX_CPU_NUMBER + 1];
BLASLONG range_n[MAX_CPU_NUMBER];
BLASLONG width, i, num_cpu;
double dnum;
int mask = 3;
#ifdef SMP
#ifndef COMPLEX
#ifdef XDOUBLE
int mode = BLAS_XDOUBLE | BLAS_REAL;
#elif defined(DOUBLE)
int mode = BLAS_DOUBLE | BLAS_REAL;
#else
int mode = BLAS_SINGLE | BLAS_REAL;
#endif
#else
#ifdef XDOUBLE
int mode = BLAS_XDOUBLE | BLAS_COMPLEX;
#elif defined(DOUBLE)
int mode = BLAS_DOUBLE | BLAS_COMPLEX;
#else
int mode = BLAS_SINGLE | BLAS_COMPLEX;
#endif
#endif
#endif
args.m = m;
args.a = (void *)a;
args.b = (void *)x;
args.c = (void *)buffer;
args.lda = lda;
args.ldb = incx;
args.ldc = incy;
dnum = (double)m * (double)m / (double)nthreads;
num_cpu = 0;
#ifndef LOWER
range_m[0] = 0;
i = 0;
while (i < m){
if (nthreads - num_cpu > 1) {
double di = (double)i;
width = ((BLASLONG)(sqrt(di * di + dnum) - di) + mask) & ~mask;
if (width < 4) width = 4;
if (width > m - i) width = m - i;
} else {
width = m - i;
}
range_m[num_cpu + 1] = range_m[num_cpu] + width;
range_n[num_cpu] = num_cpu * (((m + 15) & ~15) + 16);
if (range_n[num_cpu] > m * num_cpu) range_n[num_cpu] = m * num_cpu;
queue[MAX_CPU_NUMBER - num_cpu - 1].mode = mode;
queue[MAX_CPU_NUMBER - num_cpu - 1].routine = symv_kernel;
queue[MAX_CPU_NUMBER - num_cpu - 1].args = &args;
queue[MAX_CPU_NUMBER - num_cpu - 1].range_m = &range_m[num_cpu];
queue[MAX_CPU_NUMBER - num_cpu - 1].range_n = &range_n[num_cpu];
queue[MAX_CPU_NUMBER - num_cpu - 1].sa = NULL;
queue[MAX_CPU_NUMBER - num_cpu - 1].sb = NULL;
queue[MAX_CPU_NUMBER - num_cpu - 1].next = &queue[MAX_CPU_NUMBER - num_cpu];
num_cpu ++;
i += width;
}
if (num_cpu) {
queue[MAX_CPU_NUMBER - num_cpu].sa = NULL;
queue[MAX_CPU_NUMBER - num_cpu].sb = buffer + num_cpu * (((m + 255) & ~255) + 16) * COMPSIZE;
queue[MAX_CPU_NUMBER - 1].next = NULL;
exec_blas(num_cpu, &queue[MAX_CPU_NUMBER - num_cpu]);
}
#else
range_m[0] = 0;
i = 0;
while (i < m){
if (nthreads - num_cpu > 1) {
double di = (double)(m - i);
if (di * di - dnum > 0) {
width = ((BLASLONG)(-sqrt(di * di - dnum) + di) + mask) & ~mask;
} else {
width = m - i;
}
if (width < 4) width = 4;
if (width > m - i) width = m - i;
} else {
width = m - i;
}
range_m[num_cpu + 1] = range_m[num_cpu] + width;
range_n[num_cpu] = num_cpu * (((m + 15) & ~15) + 16);
if (range_n[num_cpu] > m * num_cpu) range_n[num_cpu] = m * num_cpu;
queue[num_cpu].mode = mode;
queue[num_cpu].routine = symv_kernel;
queue[num_cpu].args = &args;
queue[num_cpu].range_m = &range_m[num_cpu];
queue[num_cpu].range_n = &range_n[num_cpu];
queue[num_cpu].sa = NULL;
queue[num_cpu].sb = NULL;
queue[num_cpu].next = &queue[num_cpu + 1];
num_cpu ++;
i += width;
}
if (num_cpu) {
queue[0].sa = NULL;
queue[0].sb = buffer + num_cpu * (((m + 255) & ~255) + 16) * COMPSIZE;
queue[num_cpu - 1].next = NULL;
exec_blas(num_cpu, queue);
}
#endif
#ifndef LOWER
for (i = 0; i < num_cpu - 1; i ++) {
AXPYU_K(range_m[i + 1], 0, 0, ONE,
#ifdef COMPLEX
ZERO,
#endif
buffer + range_n[i] * COMPSIZE, 1, buffer + range_n[num_cpu - 1] * COMPSIZE, 1, NULL, 0);
}
AXPYU_K(m, 0, 0,
#ifndef COMPLEX
alpha,
#else
alpha[0], alpha[1],
#endif
buffer + range_n[num_cpu - 1] * COMPSIZE, 1, y, incy, NULL, 0);
#else
for (i = 1; i < num_cpu; i ++) {
AXPYU_K(m - range_m[i], 0, 0, ONE,
#ifdef COMPLEX
ZERO,
#endif
buffer + (range_n[i] + range_m[i]) * COMPSIZE, 1, buffer + range_m[i] * COMPSIZE, 1, NULL, 0);
}
AXPYU_K(m, 0, 0,
#ifndef COMPLEX
alpha,
#else
alpha[0], alpha[1],
#endif
buffer, 1, y, incy, NULL, 0);
#endif
return 0;
}
|
