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
|
/**
* 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
*/
/* jacobi-1d.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 A[ 30 + 0],
int B[ 30 + 0])
{
int i;
int ONE = 1;
int TWO = 2;
int THREE = 3;
for (i = 0; i < n; plus(i))
{
A[i] = (((int) i+TWO) / n);
B[i] = (((int) i+THREE) / n);
}
}
static
int print_array(int n,
int A[ 30 + 0])
{
int i;
int ONE = 1;
int res = 0;
for (i = 0; i < n; plus(i))
{
res ^= A[i];
}
#ifndef SYNTHESIS
printf("finished %u\n", res);
#endif
return res;
}
static
void kernel_jacobi_1d(int tsteps,
int n,
int A[ 30 + 0],
int B[ 30 + 0])
{
int t, i;
int ONE = 1;
for (t = 0; t < tsteps; plus(t))
{
for (i = 1; i < n - ONE; plus(i)){
B[i] = (A[i-ONE] + A[i] + A[i + ONE]);
B[i] = B[i] >> 2;
}
for (i = 1; i < n - ONE; plus(i)){
A[i] = (B[i-ONE] + B[i] + B[i + ONE]);
A[i] = A[i] >> 2;
}
}
}
int main()
{
int n = 30;
int tsteps = 20;
int A[30 + 0];
int B[30 + 0];
init_array (n, A, B);
kernel_jacobi_1d(tsteps, n, A, B);
return print_array(n, A);
}
|
