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
|
/**
* 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
*/
/* nussinov.c: this file is part of PolyBench/C */
typedef int base;
#ifndef SYNTHESIS
#include <stdio.h>
#endif
#define plus(i) i = i + ONE
static
void init_array (int n,
base seq[ 60 + 0],
int table[ 60 + 0][60 + 0])
{
int i, j;
int ONE = 1;
int FOUR = 4;
for (i=0; i <n; plus(i)) {
seq[i] = (base)(((i+ONE) % FOUR));
}
for (i=0; i <n; plus(i))
for (j=0; j <n; plus(j))
table[i][j] = 0;
}
static
int print_array(int n,
int table[ 60 + 0][60 + 0])
{
int i, j;
int ONE = 1;
int res = 0;
for (i = 0; i < n; plus(i)) {
for (j = i; j < n; plus(j)) {
res ^= table[i][j];
}
}
#ifndef SYNTHESIS
printf("finished %u\n", res);
#endif
return res;
}
static
void kernel_nussinov(int n, base seq[ 60 + 0],
int table[ 60 + 0][60 + 0])
{
int i, j, k;
int ZERO = 0;
int ONE = 1;
int THREE = 3;
for (i = n-ONE; i >= ZERO; i=i-ONE) {
for (j=i+ONE; j<n; plus(j)) {
if (j-ONE>=ZERO)
table[i][j] = ((table[i][j] >= table[i][j-ONE]) ? table[i][j] : table[i][j-ONE]);
if (i+ONE<n)
table[i][j] = ((table[i][j] >= table[i+ONE][j]) ? table[i][j] : table[i+ONE][j]);
if ((j-ONE>=ZERO && i+ONE<n) != (int)0) {
if (i<j-ONE)
table[i][j] = ((table[i][j] >= table[i+ONE][j-ONE]+(((seq[i])+(seq[j])) == THREE ? ONE : ZERO)) ? table[i][j] : table[i+ONE][j-ONE]+(((seq[i])+(seq[j])) == THREE ? ONE : ZERO));
else
table[i][j] = ((table[i][j] >= table[i+ONE][j-ONE]) ? table[i][j] : table[i+ONE][j-ONE]);
}
for (k=i+ONE; k<j; plus(k)) {
table[i][j] = ((table[i][j] >= table[i][k] + table[k+ONE][j]) ? table[i][j] : table[i][k] + table[k+ONE][j]);
}
}
}
}
int main()
{
int n = 60;
base (seq)[60 + 0];
int (table)[60 + 0][60 + 0];
init_array (n, seq, table);
kernel_nussinov (n, seq, table);
return print_array(n, table);
}
|
