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
|
/**
* 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
*/
/* bicg.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 m, int n,
int A[ 42 + 0][38 + 0],
int r[ 42 + 0],
int p[ 38 + 0])
{
int i, j;
int ONE = 1;
for (i = 0; i < m; plus(i))
p[i] = ((i % m) / m);
for (i = 0; i < n; plus(i)) {
r[i] = ((i % n) / n);
for (j = 0; j < m; plus(j))
A[i][j] = (((i*(j+ONE)) % n) / n);
}
}
static
int print_array(int m, int n,
int s[ 38 + 0],
int q[ 42 + 0])
{
int i;
int ONE = 1;
int res = 0;
for (i = 0; i < m; plus(i)) {
res ^= s[i];
}
for (i = 0; i < n; plus(i)) {
res ^= q[i];
}
#ifndef SYNTHESIS
printf("finished %u\n", res);
#endif
return res;
}
static
void kernel_bicg(int m, int n,
int A[ 42 + 0][38 + 0],
int s[ 38 + 0],
int q[ 42 + 0],
int p[ 38 + 0],
int r[ 42 + 0])
{
int i, j;
int ONE = 1;
for (i = 0; i < m; plus(i))
s[i] = 0;
for (i = 0; i < n; plus(i))
{
q[i] = 0;
for (j = 0; j < m; plus(j))
{
s[j] = s[j] + r[i] * A[i][j];
q[i] = q[i] + A[i][j] * p[j];
}
}
}
int main()
{
int n = 42;
int m = 38;
int A[42 + 0][38 + 0];
int s[38 + 0];
int q[42 + 0];
int p[38 + 0];
int r[42 + 0];
init_array (m, n,
A,
r,
p);
kernel_bicg (m, n,
A,
s,
q,
p,
r);
return print_array(m, n, s, q);
}
|
