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
|
/**
* This version is stamped on May 10, 2016
*
* Contact:
* Louis-Noel Pouchet <pouchet.ohio-state.edu>
* Tomofumi Yuki <tomofumi.yuki.fr>
*
* Web address: http://polybench.sourceforge.net
*/
/* gemm.c: this file is part of PolyBench/C */
#ifndef SYNTHESIS
#include <stdio.h>
#endif
#define plus(i) i = i + ONE
static
void init_array(int ni, int nj, int nk,
int *alpha,
int *beta,
int C[ 20 + 0][25 + 0],
int A[ 20 + 0][30 + 0],
int B[ 30 + 0][25 + 0])
{
int i, j;
int ONE = 1;
*alpha = 2;
*beta = 2;
for (i = 0; i < ni; plus(i))
for (j = 0; j < nj; plus(j))
C[i][j] = (int) ((i*j+ONE) % ni) / ni;
for (i = 0; i < ni; plus(i))
for (j = 0; j < nk; plus(j))
A[i][j] = (int) (((i*(j+ONE)) % nk) / nk);
for (i = 0; i < nk; plus(i))
for (j = 0; j < nj; plus(j))
B[i][j] = (int) (((i*(j+ONE+ONE)) % nj) / nj);
}
static
int print_array(int ni, int nj,
int C[ 20 + 0][25 + 0])
{
int i, j;
int ONE = 1;
int res = 0;
for (i = 0; i < ni; plus(i))
for (j = 0; j < nj; plus(j)) {
res ^= C[i][j];
}
#ifndef SYNTHESIS
printf("finished %u\n", res);
#endif
return res;
}
static
void kernel_gemm(int ni, int nj, int nk,
int alpha,
int beta,
int C[ 20 + 0][25 + 0],
int A[ 20 + 0][30 + 0],
int B[ 30 + 0][25 + 0])
{
int i, j, k;
int ONE = 1;
for (i = 0; i < ni; plus(i)) {
for (j = 0; j < nj; plus(j))
C[i][j] *= beta;
for (k = 0; k < nk; plus(k)) {
for (j = 0; j < nj; plus(j))
C[i][j] += alpha * A[i][k] * B[k][j];
}
}
}
int main()
{
int ni = 20;
int nj = 25;
int nk = 30;
int alpha;
int beta;
int C[20 + 0][25 + 0];
int A[20 + 0][30 + 0];
int B[30 + 0][25 + 0];
init_array (ni, nj, nk, &alpha, &beta,
C,
A,
B);
kernel_gemm (ni, nj, nk,
alpha, beta,
C,
A,
B);
return
print_array(ni, nj, C);
}
|
