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
|
/* blas/source_gemm_r.h
*
* Copyright (C) 2001 Brian Gough
*
* 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, k;
INDEX n1, n2;
INDEX ldf, ldg;
int TransF, TransG;
const BASE *F, *G;
if (alpha == 0.0 && beta == 1.0)
return;
if (Order == CblasRowMajor) {
n1 = M;
n2 = N;
F = A;
ldf = lda;
TransF = (TransA == CblasConjTrans) ? CblasTrans : TransA;
G = B;
ldg = ldb;
TransG = (TransB == CblasConjTrans) ? CblasTrans : TransB;
} else {
n1 = N;
n2 = M;
F = B;
ldf = ldb;
TransF = (TransB == CblasConjTrans) ? CblasTrans : TransB;
G = A;
ldg = lda;
TransG = (TransA == CblasConjTrans) ? CblasTrans : TransA;
}
/* form y := beta*y */
if (beta == 0.0) {
for (i = 0; i < n1; i++) {
for (j = 0; j < n2; j++) {
C[ldc * i + j] = 0.0;
}
}
} else if (beta != 1.0) {
for (i = 0; i < n1; i++) {
for (j = 0; j < n2; j++) {
C[ldc * i + j] *= beta;
}
}
}
if (alpha == 0.0)
return;
if (TransF == CblasNoTrans && TransG == CblasNoTrans) {
/* form C := alpha*A*B + C */
for (k = 0; k < K; k++) {
for (i = 0; i < n1; i++) {
const BASE temp = alpha * F[ldf * i + k];
if (temp != 0.0) {
for (j = 0; j < n2; j++) {
C[ldc * i + j] += temp * G[ldg * k + j];
}
}
}
}
} else if (TransF == CblasNoTrans && TransG == CblasTrans) {
/* form C := alpha*A*B' + C */
for (i = 0; i < n1; i++) {
for (j = 0; j < n2; j++) {
BASE temp = 0.0;
for (k = 0; k < K; k++) {
temp += F[ldf * i + k] * G[ldg * j + k];
}
C[ldc * i + j] += alpha * temp;
}
}
} else if (TransF == CblasTrans && TransG == CblasNoTrans) {
for (k = 0; k < K; k++) {
for (i = 0; i < n1; i++) {
const BASE temp = alpha * F[ldf * k + i];
if (temp != 0.0) {
for (j = 0; j < n2; j++) {
C[ldc * i + j] += temp * G[ldg * k + j];
}
}
}
}
} else if (TransF == CblasTrans && TransG == CblasTrans) {
for (i = 0; i < n1; i++) {
for (j = 0; j < n2; j++) {
BASE temp = 0.0;
for (k = 0; k < K; k++) {
temp += F[ldf * k + i] * G[ldg * j + k];
}
C[ldc * i + j] += alpha * temp;
}
}
} else {
BLAS_ERROR("unrecognized operation");
}
}
|
