blob: 776d95ab1d599d8953a2e6ff040201a223422420 (
plain)
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
|
/**
* 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
*/
/* floyd-warshall.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 path[ 60 + 0][60 + 0])
{
int i, j;
int ONE = 1;
for (i = 0; i < n; plus(i))
for (j = 0; j < n; plus(j)) {
path[i][j] = i*(j % (ONE+6))+ONE;
//if (((i+j)%13 == ZERO || (i+j)%7== ZERO || (i+j)%11 == ZERO ) != 0 )
if(((((i+j) % (12+ONE)) == (int)0 || ((i+j) % (ONE+6)) == (int)0)!=0 || ((i+j) % (10+ONE)) == (int)0 ) != 0)
path[i][j] = 999;
}
}
static
int print_array(int n,
int path[ 60 + 0][60 + 0])
{
int i, j;
int res = 0;
int ONE = 1;
for (i = 0; i < n; plus(i))
for (j = 0; j < n; plus(j)) {
res ^= path[i][j];
}
#ifndef SYNTHESIS
printf("finished %u\n", res);
#endif
return res;
}
static
void kernel_floyd_warshall(int n,
int path[ 60 + 0][60 + 0])
{
int i, j, k;
int ONE = 1;
for (k = 0; k < n; plus(k))
{
for(i = 0; i < n; plus(i))
for (j = 0; j < n; plus(j))
path[i][j] = path[i][j] < path[i][k] + path[k][j] ?
path[i][j] : path[i][k] + path[k][j];
}
}
int main()
{
int n = 60;
int path[60 + 0][60 + 0];
init_array (n, path);
kernel_floyd_warshall (n, path);
return print_array(n, path);
return 0;
}
|
