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
|
/**
* 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
*/
/* gesummv.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[ 30 + 0][30 + 0],
int B[ 30 + 0][30 + 0],
int x[ 30 + 0])
{
int i, j;
int ONE = 1;
*alpha = 3;
*beta = 2;
for (i = 0; i < n; plus(i))
{
x[i] = (int) ((i % n) / n);
for (j = 0; j < n; plus(j)) {
A[i][j] = (int) (((i*j+ONE) % n) / n);
B[i][j] = (int) (((i*j+ONE+ONE) % n) / n);
}
}
}
static
int print_array(int n,
int y[ 30 + 0])
{
int i;
int ONE = 1;
int res = 0;
for (i = 0; i < n; plus(i)) {
res ^= y[i];
}
#ifndef SYNTHESIS
printf("finished: %u\n", res);
#endif
return res;
}
static
void kernel_gesummv(int n,
int alpha,
int beta,
int A[ 30 + 0][30 + 0],
int B[ 30 + 0][30 + 0],
int tmp[ 30 + 0],
int x[ 30 + 0],
int y[ 30 + 0])
{
int i, j;
int ONE = 1;
for (i = 0; i < n; plus(i))
{
tmp[i] = 0;
y[i] = 0;
for (j = 0; j < n; plus(j))
{
tmp[i] = A[i][j] * x[j] + tmp[i];
y[i] = B[i][j] * x[j] + y[i];
}
y[i] = alpha * tmp[i] + beta * y[i];
}
}
int main()
{
int n = 30;
int alpha;
int beta;
int A[30 + 0][30 + 0];
int B[30 + 0][30 + 0];
int tmp[30 + 0];
int x[30 + 0];
int y[30 + 0];
init_array (n, &alpha, &beta,
A,
B,
x);
kernel_gesummv (n, alpha, beta,
A,
B,
tmp,
x,
y);
return print_array(n, y);
}
|
