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
|
/* blas/source_trmv_r.h
*
* Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or (at
* your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
{
INDEX i, j;
const int nonunit = (Diag == CblasNonUnit);
const int Trans = (TransA != CblasConjTrans) ? TransA : CblasTrans;
if ((order == CblasRowMajor && Trans == CblasNoTrans && Uplo == CblasUpper)
|| (order == CblasColMajor && Trans == CblasTrans && Uplo == CblasLower)) {
/* form x := A*x */
INDEX ix = OFFSET(N, incX);
for (i = 0; i < N; i++) {
BASE temp = 0.0;
const INDEX j_min = i + 1;
const INDEX j_max = N;
INDEX jx = OFFSET(N, incX) + j_min * incX;
for (j = j_min; j < j_max; j++) {
temp += X[jx] * A[lda * i + j];
jx += incX;
}
if (nonunit) {
X[ix] = temp + X[ix] * A[lda * i + i];
} else {
X[ix] += temp;
}
ix += incX;
}
} else if ((order == CblasRowMajor && Trans == CblasNoTrans && Uplo == CblasLower)
|| (order == CblasColMajor && Trans == CblasTrans && Uplo == CblasUpper)) {
INDEX ix = OFFSET(N, incX) + (N - 1) * incX;
for (i = N; i > 0 && i--;) {
BASE temp = 0.0;
const INDEX j_min = 0;
const INDEX j_max = i;
INDEX jx = OFFSET(N, incX) + j_min * incX;
for (j = j_min; j < j_max; j++) {
temp += X[jx] * A[lda * i + j];
jx += incX;
}
if (nonunit) {
X[ix] = temp + X[ix] * A[lda * i + i];
} else {
X[ix] += temp;
}
ix -= incX;
}
} else if ((order == CblasRowMajor && Trans == CblasTrans && Uplo == CblasUpper)
|| (order == CblasColMajor && Trans == CblasNoTrans && Uplo == CblasLower)) {
/* form x := A'*x */
INDEX ix = OFFSET(N, incX) + (N - 1) * incX;
for (i = N; i > 0 && i--;) {
BASE temp = 0.0;
const INDEX j_min = 0;
const INDEX j_max = i;
INDEX jx = OFFSET(N, incX) + j_min * incX;
for (j = j_min; j < j_max; j++) {
temp += X[jx] * A[lda * j + i];
jx += incX;
}
if (nonunit) {
X[ix] = temp + X[ix] * A[lda * i + i];
} else {
X[ix] += temp;
}
ix -= incX;
}
} else if ((order == CblasRowMajor && Trans == CblasTrans && Uplo == CblasLower)
|| (order == CblasColMajor && Trans == CblasNoTrans && Uplo == CblasUpper)) {
INDEX ix = OFFSET(N, incX);
for (i = 0; i < N; i++) {
BASE temp = 0.0;
const INDEX j_min = i + 1;
const INDEX j_max = N;
INDEX jx = OFFSET(N, incX) + (i + 1) * incX;
for (j = j_min; j < j_max; j++) {
temp += X[jx] * A[lda * j + i];
jx += incX;
}
if (nonunit) {
X[ix] = temp + X[ix] * A[lda * i + i];
} else {
X[ix] += temp;
}
ix += incX;
}
} else {
BLAS_ERROR("unrecognized operation");
}
}
|
