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
|
/**
* 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
*/
/* gemver.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 n,
int *alpha,
int *beta,
int A[ 40 + 0][40 + 0],
int u1[ 40 + 0],
int v1[ 40 + 0],
int u2[ 40 + 0],
int v2[ 40 + 0],
int w[ 40 + 0],
int x[ 40 + 0],
int y[ 40 + 0],
int z[ 40 + 0])
{
int i, j;
int ONE = 1;
*alpha = 3;
*beta = 2;
int fn = (int)n;
for (i = 0; i < n; plus(i))
{
u1[i] = i;
u2[i] = ((i+ONE)/(fn*2));
v1[i] = ((i+ONE)/(fn*4));
v2[i] = ((i+ONE)/(fn*6));
y[i] = ((i+ONE)/(fn*8));
z[i] = ((i+ONE)/(fn*9));
x[i] = 0;
w[i] = 0;
for (j = 0; j < n; plus(j))
A[i][j] = (int) (((i*j) % n) / n);
}
}
static
int print_array(int n,
int w[ 40 + 0])
{
int i;
int ONE = 1;
int res = 0;
for (i = 0; i < n; plus(i)) {
res ^= w[i];
}
#ifndef SYNTHESIS
printf("finished %u\n", res);
#endif
return res;
}
static
void kernel_gemver(int n,
int alpha,
int beta,
int A[ 40 + 0][40 + 0],
int u1[ 40 + 0],
int v1[ 40 + 0],
int u2[ 40 + 0],
int v2[ 40 + 0],
int w[ 40 + 0],
int x[ 40 + 0],
int y[ 40 + 0],
int z[ 40 + 0])
{
int i, j;
int ONE = 1;
for (i = 0; i < n; plus(i))
for (j = 0; j < n; plus(j))
A[i][j] = A[i][j] + u1[i] * v1[j] + u2[i] * v2[j];
for (i = 0; i < n; plus(i))
for (j = 0; j < n; plus(j))
x[i] = x[i] + beta * A[j][i] * y[j];
for (i = 0; i < n; plus(i))
x[i] = x[i] + z[i];
for (i = 0; i < n; plus(i))
for (j = 0; j < n; plus(j))
w[i] = w[i] + alpha * A[i][j] * x[j];
}
int main()
{
int n = 40;
int alpha;
int beta;
int A[40 + 0][40 + 0];
int u1[40 + 0];
int v1[40 + 0];
int u2[40 + 0];
int v2[40 + 0];
int w[40 + 0];
int x[40 + 0];
int y[40 + 0];
int z[40 + 0];
init_array (n, &alpha, &beta,
A,
u1,
v1,
u2,
v2,
w,
x,
y,
z);
kernel_gemver (n, alpha, beta,
A,
u1,
v1,
u2,
v2,
w,
x,
y,
z);
return print_array(n, w);
}
|
