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
|
/**
* 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
*/
/* trisolv.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 L[ 40 ][40 ],
int x[ 40 ],
int b[ 40 ])
{
int i, j;
int ONE = 1;
for (i = 0; i < n; plus(i))
{
x[i] = -999;
b[i] = i ;
for (j = 0; j <= i; plus(j))
L[i][j] = (int) (((i+n-j+ONE)*(ONE+ONE)) / n);
}
}
static
int check_array(int n,
int x[ 40])
{
int i;
int res = 0;
int ONE = 1;
for (i = 0; i < n; plus(i)) {
res ^= x[i];
}
#ifndef SYNTHESIS
printf("finished: %u\n", res);
#endif
return res;
}
static
void kernel_trisolv(int n,
int L[ 40 + 0][40 + 0],
int x[ 40 + 0],
int b[ 40 + 0])
{
int i, j;
int ONE = 1;
for (i = 0; i < n; plus(i))
{
x[i] = b[i];
for (j = 0; j <i; plus(j))
x[i] -= L[i][j] * x[j];
x[i] = (x[i] / L[i][i]);
}
}
int main()
{
int n = 40;
int L[40 + 0][40 + 0];
int x[40 + 0];
int b[40 + 0];
init_array (n, L, x, b);
kernel_trisolv (n, L, x, b);
return check_array(n, x);
return 0;
}
|
