/** * This version is stamped on May 10, 2016 * * Contact: * Louis-Noel Pouchet * Tomofumi Yuki * * Web address: http://polybench.sourceforge.net */ /* nussinov.c: this file is part of PolyBench/C */ typedef int base; #include "../include/misc.h" #ifndef SYNTHESIS #include #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 = ZERO; i=i-ONE) { for (j=i+ONE; j=ZERO) table[i][j] = ((table[i][j] >= table[i][j-ONE]) ? table[i][j] : table[i][j-ONE]); if (i+ONE= table[i+ONE][j]) ? table[i][j] : table[i+ONE][j]); if ((j-ONE>=ZERO && i+ONE= 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= 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); }