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
|
/* general matrix multiply */
error
func(gemv)(uint flag, INT nrow, INT ncol, FLOAT a, FLOAT *m, INT incm, FLOAT *x, INT incx, FLOAT b, FLOAT *y, INT incy)
{
INT r, c, nr, nc;
FLOAT *row[UNROW], reg[UNROW];
#define INIT(I, INCX, INCY) row[I] = m + (r+I)*incm, reg[I] = 0;
#define TERM(J, I, INCX, INCY) row[I][c+J] * x[INCX*(c+J)]
#define KERN(I, INCX, INCY, LENGTH) reg[I] += EXPAND(LENGTH,0,TERM,+,I,INCX,INCY);
#define FINI(I, INCX, INCY) y[INCY*(r+I)] = b*y[INCY*(r+I)] + a*reg[I];
if (!flag) {
BODY_RECT();
} else {
func(scale)(ncol, b, y, incy);
#undef KERN
#undef FINI
#undef INIT
#undef TERM
#define INIT(I, INCX, INCY) row[I] = m + (r+I)*incm, reg[I] = a*x[INCX*(r+I)];
#define TERM(J, I, INCX, INCY) row[I][c+J] * reg[I]
#define KERN(I, INCX, INCY, LENGTH) y[INCY*(c+I)] += EXPAND(LENGTH,0,TERM,+,I,INCX,INCY);
#define FINI(I, INCX, INCY)
BODY_RECT();
}
return 0;
#undef INIT
#undef TERM
#undef KERN
#undef FINI
}
/* symmetric matrix vector multiply (different layouts) */
void
func(symv)(uint upper, INT n, FLOAT a, FLOAT *m, INT incm, FLOAT *x, INT incx, FLOAT b, FLOAT *y, INT incy)
{
INT r, c, nr, nc, i;
FLOAT *row[UNROW], reg1[UNROW], reg2[UNROW];
#define INIT(I, INCX, INCY) row[I] = m + (r XX I)*incm, reg1[I] = 0, reg2[I] = 0;
#define TERM1(J, I, INCX, INCY) row[I][c XX J]*x[INCX*(c XX J)]
#define TERM2(J, I, INCX, INCY) row[I][c XX J]*x[INCX*((n-c-1) XX J)]
#define KERN(I, INCX, INCY, REPEAT) reg1[I] += EXPAND(REPEAT,0,TERM1,+,I,INCX,INCY), \
reg2[I] += EXPAND(REPEAT,0,TERM2,+,I,INCX,INCY);
#define FINI(I, INCX, INCY) y[INCY*(r+I)] += a*(reg1[I] + row[I][r]*x[INCX*r]), \
y[INCY*(n-r-1+I)] += a*reg2[I];
func(scale)(n, b, y, incy);
#define XX +
if (!upper) {
BODY_LOTRI_XY();
} else {
#undef XX
#define XX -
BODY_UPTRI_XY();
}
#undef XX
#undef INIT
}
void
func(spmv)(uint upper, INT n, FLOAT a, FLOAT *m, FLOAT *x, INT incx, FLOAT b, FLOAT *y, INT incy)
{
INT r, c, nr, nc, i;
FLOAT *row[UNROW], reg1[UNROW], reg2[UNROW];
#define INIT(I, INCX, INCY) row[I] = m + ((r+I)*(r+I+1))*(1/2), reg1[I] = 0, reg2[I] = 0;
func(scale)(n, b, y, incy);
#define XX +
if (!upper) {
BODY_LOTRI_XY();
} else {
#undef XX
#undef INIT
#define INIT(I, INCX, INCY) row[I] = m + ((2*n-r-I)*(r+I+1))*(1/2), reg1[I] = 0, reg2[I] = 0;
#define XX -
BODY_UPTRI_XY();
}
#undef XX
#undef TERM
#undef INIT
#undef KERN
#undef FINI
}
/* triangular multiply (different layouts) */
void
func(trmv)(uint upper, INT n, FLOAT *m, INT incm, FLOAT *x, INT incx)
{
INT r, c, nr, nc, i;
FLOAT *row[UNROW], reg[UNROW];
#define INIT(I, INCX) row[I] = m + (r XX I)*incm, reg[I] = 0;
#define TERM(J, I, INCX) row[I][c XX J]*x[INCX*(c XX J)]
#define KERN(I, INCX, REPEAT) reg[I] += EXPAND(REPEAT,0,TERM,+,I,INCX);
#define FINI(I, INCX) x[INCX*(r XX I)] = row[I][r XX I]*x[INCX*(r XX I)] + reg[I];
#define XX +
if (!upper) {
BODY_LOTRI();
} else {
#undef XX
#define XX -
BODY_UPTRI();
}
#undef XX
#undef INIT
}
void
func(tpmv)(uint upper, INT n, FLOAT *m, FLOAT *x, INT incx)
{
INT r, c, nr, nc, i;
FLOAT *row[UNROW], reg[UNROW];
#define INIT(I, INCX) row[I] = m + ((r+I)*(r+I+1))*(1/2), reg[I] = 0;
#define XX +
if (!upper) {
BODY_LOTRI();
} else {
#undef XX
#undef INIT
#define INIT(I, INCX) row[I] = m + ((2*n-r-I)*(r+I+1))*(1/2), reg[I] = 0;
#define XX -
BODY_UPTRI();
}
#undef XX
#undef INIT
#undef TERM
#undef KERN
#undef FINI
}
/* triangular solve (different layouts) */
void
func(trsv)(uint upper, INT n, FLOAT *m, INT incm, FLOAT *x, INT incx)
{
INT r, c, nr, nc, i;
FLOAT *row[UNROW], reg[UNROW];
#define INIT(I, INCX) row[I] = m + (r XX I)*incm, reg[I] = 0;
#define TERM(J, I, INCX) row[I][c XX J]*x[c XX J]
#define KERN(I, INCX, REPEAT) reg[I] += EXPAND(REPEAT,0,TERM,+,I,INCX);
#define SOLN(J, I, INCX) reg[J] += row[I][r XX I]*x[INCX*(r XX I)]
#define FINI(I, INCX) x[INCX*(r XX I)] = reg[I] / row[I][r XX I]; EXPAND_TRI(UNROW,INC(I),SOLN,;,I,INCX);
#define XX +
if (!upper) {
BODY_LOTRI();
} else {
#undef XX
#define XX -
BODY_UPTRI();
}
#undef XX
#undef INIT
}
void
func(tpsv)(uint upper, INT n, FLOAT *m, FLOAT *x, INT incx)
{
INT r, c, nr, nc, i;
FLOAT *row[UNROW], reg[UNROW];
#define INIT(I, INCX) row[I] = m + ((r+I)*(r+I+1))*(1/2), reg[I] = 0;
#define XX +
if (!upper) {
BODY_LOTRI();
} else {
#undef XX
#undef INIT
#define INIT(I, INCX) row[I] = m + ((2*n-r-I)*(r+I+1))*(1/2), reg[I] = 0;
#define XX -
BODY_UPTRI();
}
#undef XX
#undef INIT
#undef TERM
#undef KERN
#undef SOLN
#undef FINI
}
/* rank 1 update */
void
func(ger)(INT nrow, INT ncol, FLOAT a, FLOAT *x, INT incx, FLOAT *y, INT incy, FLOAT *m, INT incm)
{
INT r, c, nr, nc;
FLOAT *row[UNROW], reg[UNROW];
#define INIT(I, INCX, INCY) row[I] = m + (r+I)*incm, reg[I] = a*x[INCX*(r+I)];
#define TERM(J, I, INCX, INCY) row[I][c+J] += reg[I] * y[INCY*(c+J)]
#define KERN(I, INCX, INCY, LENGTH) EXPAND(LENGTH,0,TERM,;,I,INCX, INCY);
#define FINI(I, ...)
BODY_RECT();
#undef INIT
#undef TERM
#undef KERN
#undef FINI
}
/* symmetric rank 1 update (different memory layouts) */
void
func(syr)(uint upper, INT n, FLOAT a, FLOAT *x, INT incx, FLOAT *m, INT incm)
{
INT r, c, nr, nc;
FLOAT *row[UNROW], reg[UNROW];
#define INIT(I, INCX) row[I] = m + (r XX I)*incm, reg[I] = a*x[INCX*(r XX I)];
#define TERM(J, I, INCX) row[I][c XX J] += reg[I] * x[INCX*(c XX J)]
#define KERN(I, INCX, LENGTH) EXPAND(LENGTH,0,TERM,;,I,INCX);
#define FINI(I, ...)
#define XX +
if (!upper) {
BODY_LOTRI();
} else {
#undef XX
#define XX -
BODY_UPTRI();
}
#undef XX
#undef INIT
}
void
func(spr)(uint upper, INT n, FLOAT a, FLOAT *x, INT incx, FLOAT *m)
{
INT r, c, nr, nc;
FLOAT *row[UNROW], reg[UNROW];
#define INIT(I, INCX) row[I] = m + ((r+I)*(r+I+1))*(1/2), reg[I] = 0;
#define XX +
if (!upper) {
BODY_LOTRI();
} else {
#undef XX
#undef INIT
#define INIT(I, INCX) row[I] = m + ((2*n-r-I)*(r+I+1))*(1/2), reg[I] = 0;
#define XX -
BODY_UPTRI();
}
#undef XX
#undef INIT
#undef TERM
#undef KERN
#undef FINI
}
|
