-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest.c
276 lines (238 loc) · 7.82 KB
/
test.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
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
#include "cblas.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/time.h>
#define MIN(x, y) ((x < y ? x : y))
#define MAX(x, y) ((x > y ? x : y))
int main(int argc, char const *argv[]) {
int N = 6;
double *A;
double *B;
register int i, k, j;
int numMatrixElems = N * N;
A = malloc(numMatrixElems * sizeof(*A));
B = malloc(numMatrixElems * sizeof(*B));
int nr = 0, nr2 = 9;
for (i = 0; i != N; ++i) {
for (j = i; j != N; ++j) {
A[i * N + j] = nr;
nr++;
}
for (j = 0; j != N; ++j) {
B[i * N + j] = nr2;
nr2++;
}
}
double *AA_tr;
AA_tr = malloc(numMatrixElems * sizeof(*AA_tr));
// for (i = 0; i != N; ++i) {
// for (j = 0; j != N; ++j) {
// for (k = 0; k != N; ++k) {
// AA_tr[i * N + j] += A[k * N + i] * A[k * N + j];
// // AA_tr[i * N + j] += B[i * N + k] * A[j * N + k];
// }
// }
// }
// for (i = 0; i != N; ++i) {
// for (j = 0; j != N; ++j) {
// for (k = 0; k != N; ++k) {
// AA_tr[i * N + j] += B[i * N + k] * B[j * N + k];
// }
// }
// }
// for (i = 0; i != N; ++i) {
// for (j = 0; j != N; ++j) {
// for (k = i; k != N; ++k) {
// AA_tr[i * N + j] += A[i * N + k] * B[k * N + j];
// }
// }
// }
// for (i = 0; i < N; i++) {
// for (j = 0; j < N; j++) {
// for (k = 0; k <= i; k++) {
// AA_tr[i * N + j] += A[k * N + i] * A[k * N + j];
// }
// }
// }
// double *A1;
// double *B1;
// double *ABB_tr;
// double *OUT;
// double *BB_tr;
// // allocate memory fro new matrix
// A1 = malloc(N * N * sizeof(*A1));
// B1 = malloc(N * N * sizeof(*B1));
// ABB_tr = malloc(N * N * sizeof(*ABB_tr));
// OUT = malloc(N * N * sizeof(*OUT));
// BB_tr = malloc(N * N * sizeof(*BB_tr));
// AA_tr = malloc(N * N * sizeof(*AA_tr));
// // AA_tr
// for (i = 0; i != N; ++i) {
// for (j = 0; j != N; ++j) {
// for (k = 0; k != N; ++k) {
// AA_tr[i * N + j] += A[k * N + i] * A[k * N + j];
// }
// }
// }
// // try to optimize
// /* for (i = 0; i < N; i++) {
// for (j = 0; j < N; j++) {
// for (k = 0; k <= i; k++) {
// AA_tr[i * N + j] += A[k * N + i] * A[k * N + j];
// }
// }
// }*/
// // BB_tr
// for (i = 0; i != N; ++i) {
// for (j = 0; j != N; ++j) {
// for (k = 0; k != N; ++k) {
// BB_tr[i * N + j] += B[i * N + k] * B[j * N + k];
// }
// }
// }
// // ABB_tr
// for (i = 0; i != N; ++i) {
// for (j = 0; j != N; ++j) {
// for (k = i; k != N; ++k) {
// ABB_tr[i * N + j] += A[i * N + k] * BB_tr[k * N + j];
// }
// }
// }
// // ABB_tr + AA_tr
// for (i = 0; i != N; ++i) {
// for (j = 0; j != N; ++j) {
// OUT[i * N + j] = ABB_tr[i * N + j] + AA_tr[i * N + j];
// }
// }
double *BB_tr;
double *ABB_tr;
double *OUT;
ABB_tr = malloc(N * N * sizeof(*ABB_tr));
BB_tr = malloc(N * N * sizeof(*BB_tr));
AA_tr = malloc(N * N * sizeof(*AA_tr));
OUT = malloc(N * N * sizeof(*OUT));
/*memcpy(BB_tr, B, N * N * sizeof(*BB_tr));
cblas_dgemm(CblasRowMajor, CblasNoTrans, CblasTrans, N, N, N, 1.0, B, N, B, N,
0.0, BB_tr, N);*/
// memcpy(ABB_tr, A, N * N * sizeof(*ABB_tr));
// cblas_dtrmm(CblasRowMajor, CblasLeft, CblasUpper, CblasNoTrans,
// CblasNonUnit,
// N, N, 1.0, ABB_tr, N, B, N);
// memcpy(AA_tr, A, N * N * sizeof(*AA_tr));
// cblas_dtrmm(CblasRowMajor, CblasLeft, CblasUpper, CblasTrans, CblasNonUnit,
// N,
// N, 1.0, A, N, AA_tr, N);
// for (i = 0; i != N; ++i) {
// register double *BB_tr_ptr = BB_tr + i * N;
// register double *B_cpy = B + i * N;
// for (j = 0; j != N; ++j, ++BB_tr_ptr) {
// register double res = 0;
// register double *B_ptr = B_cpy;
// register double *B_tr_ptr = B + j * N;
// for (k = 0; k != N; ++k, ++B_ptr, ++B_tr_ptr) {
// res += *B_ptr * *B_tr_ptr;
// }
// *BB_tr_ptr = res;
// }
// }
// memcpy(BB_tr, B, N * N * sizeof(*BB_tr));
// for (i = 0; i != N; ++i) {
// register double *ABB_tr_ptr = ABB_tr + i * N;
// register double *A_cpy = A + i * N;
// for (j = 0; j != N; ++j, ++ABB_tr_ptr) {
// register double res = 0;
// register double *A_ptr = A_cpy + i;
// register double *BB_tr_ptr = BB_tr + i * N + j;
// for (k = i; k != N; ++k, ++A_ptr, BB_tr_ptr += N) {
// res += *A_ptr * *BB_tr_ptr;
// }
// *ABB_tr_ptr += res;
// }
// }
// for (i = 0; i < N; ++i) {
// register double *AA_tr_ptr = AA_tr + i * N;
// register double *A_cpy = A + i * N;
// for (j = 0; j < N; ++j, ++AA_tr_ptr) {
// register double res = 0;
// register double *A_ptr = A_cpy + i;
// register double *A_tr_ptr = A + i * N + j;
// for (k = 0; k <= MIN(i, j); ++k, ++A_ptr, A_tr_ptr += N) {
// res += *A_tr_ptr * *A_ptr;
// }
// *AA_tr_ptr += res;
// }
// }
for (i = 0; i < N; ++i) {
register double *AA_tr_ptr = AA_tr + i * N;
for (j = 0; j < N; ++j, ++AA_tr_ptr) {
register double res = 0;
for (k = 0; k <= MIN(i, j); ++k) {
res += A[k * N + i] * A[k * N + j];
}
*AA_tr_ptr += res;
}
}
for (int i = 0; i < 6; ++i) {
for (int j = 0; j < 6; ++j) {
printf("%f ", A[i * N + j]);
}
printf("\n");
}
printf("\n");
for (int i = 0; i < 6; ++i) {
for (int j = 0; j < 6; ++j) {
printf("%f ", B[i * N + j]);
}
printf("\n");
}
printf("\n");
for (int i = 0; i < 6; ++i) {
for (int j = 0; j < 6; ++j) {
printf("%f ", AA_tr[i * N + j]);
}
printf("\n");
}
return 0;
}
/*
A = [0.680375 0.566198 0.823295 -0.329554 -0.444451 -0.045206;
0 0.904459 0.271423 -0.716795 -0.967399 -0.725537;
0 0 0.997849 0.025865 0.225280 0.275105;
0 0 0 -0.199543 -0.433371 0.615449; 0 0 0 0 -0.871657 -0.084597;
0 0 0 0 0 0.063213]*/
/*A = [0.000000 1.000000 2.000000 3.000000 4.000000 5.000000;
0 7.000000 8.000000 9.000000 10.000000 11.000000;
0 0 14.000000 15.000000 16.000000 17.000000;
0 0 0 21.000000 22.000000 23.000000;
0 0 0 0 28.000000 29.000000;
0 0 0 0 0 35.000000] */
/*a = [0.000000 1.000000 2.000000 3.000000 4.000000 5.000000;
0.000000 6.000000 7.000000 8.000000 9.000000 10.000000;
0.000000 0.000000 11.000000 12.000000 13.000000 14.000000;
0.000000 0.000000 0.000000 15.000000 16.000000 17.000000;
0.000000 0.000000 0.000000 0.000000 18.000000 19.000000;
0.000000 0.000000 0.000000 0.000000 0.000000 20.000000]*/
/* b= [
2.000000 2.000000 2.000000 2.000000 2.000000 2.000000;
2.000000 2.000000 2.000000 2.000000 2.000000 2.000000;
2.000000 2.000000 2.000000 2.000000 2.000000 2.000000;
2.000000 2.000000 2.000000 2.000000 2.000000 2.000000;
2.000000 2.000000 2.000000 2.000000 2.000000 2.000000;
2.000000 2.000000 2.000000 2.000000 2.000000 2.000000 ]*/
/*
b= [9.000000 10.000000 11.000000 12.000000 13.000000 14.000000;
15.000000 16.000000 17.000000 18.000000 19.000000 20.000000;
21.000000 22.000000 23.000000 24.000000 25.000000 26.000000;
27.000000 28.000000 29.000000 30.000000 31.000000 32.000000;
33.000000 34.000000 35.000000 36.000000 37.000000 38.000000;
39.000000 40.000000 41.000000 42.000000 43.000000 44.000000]
*/
/* out_ref = [34935.000000 53025.000000 71115.000000 89205.000000 107295.000000
125385.000000; 86260.000000 130937.000000 175584.000000 220231.000000
264878.000000 309525.000000; 115070.000000 174694.000000 234404.000000
294004.000000 353604.000000 413204.000000; 119244.000000 181071.000000
242990.000000 305014.000000 366828.000000 428642.000000; 99145.000000
150593.000000 202139.000000 253795.000000 305551.000000 357001.000000;
57620.000000 87565.000000 117614.000000 147778.000000 178046.000000
208391.000000]*/