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
|
/**
* 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
*/
/* adi.c: this file is part of PolyBench/C */
#define plus(i) i = i + ONE
static
void init_array (int n,
int u[ 20 + 0][20 + 0])
{
int i, j;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
{
u[i][j] = (int)(i + n-j) / n;
}
}
static
int print_array(int n,
int u[ 20 + 0][20 + 0])
{
int i, j;
int res = 0;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++) {
res ^= u[i][j];
}
return res;
}
static
void kernel_adi(int tsteps, int n,
int u[ 20 + 0][20 + 0],
int v[ 20 + 0][20 + 0],
int p[ 20 + 0][20 + 0],
int q[ 20 + 0][20 + 0])
{
int t, i, j;
int DX, DY, DT;
int B1, B2;
int mul1, mul2;
int a, b, c, d, e, f;
#pragma scop
DX = 1/(int)n;
DY = 1/(int)n;
DT = 1/(int)tsteps;
B1 = 2;
B2 = 1;
mul1 = B1 * DT / (DX * DX);
mul2 = B2 * DT / (DY * DY);
a = -mul1 / 2;
b = 1+mul1;
c = a;
d = -mul2 / 2;
e = 1+mul2;
f = d;
int ZERO = 0;
for (t=1; t<=tsteps; t++) {
for (i=1; i<n-1; i++) {
v[ZERO][i] = 1;
p[i][ZERO] = 0;
q[i][ZERO] = v[ZERO][i];
for (j=1; j<n-1; j++) {
p[i][j] = -c / (a*p[i][j-1]+b);
q[i][j] = (-d*u[j][i-1]+(1+2*d)*u[j][i] - f*u[j][i+1]-a*q[i][j-1])/(a*p[i][j-1]+b);
}
v[n-1][i] = 1;
for (j=n-2; j>=1; j--) {
v[j][i] = p[i][j] * v[j+1][i] + q[i][j];
}
}
for (i=1; i<n-1; i++) {
u[i][ZERO] = 1;
p[i][ZERO] = 0;
q[i][ZERO] = u[i][ZERO];
for (j=1; j<n-1; j++) {
p[i][j] = -f / (d*p[i][j-1]+e);
q[i][j] = (-a*v[i-1][j]+(1+2*a)*v[i][j] - c*v[i+1][j]-d*q[i][j-1])/(d*p[i][j-1]+e);
}
u[i][n-1] = 1;
for (j=n-2; j>=1; j--) {
u[i][j] = p[i][j] * u[i][j+1] + q[i][j];
}
}
}
#pragma endscop
}
int main(int argc, char** argv)
{
int n = 20;
int tsteps = 20;
int u[20 + 0][20 + 0];
int v[20 + 0][20 + 0];
int p[20 + 0][20 + 0];
int q[20 + 0][20 + 0];
init_array (n, u);
kernel_adi (tsteps, n, u, v, p, q);
return print_array(n, u);
}
|
