diff options
author | Yann Herklotz <git@yannherklotz.com> | 2021-09-22 19:26:01 +0100 |
---|---|---|
committer | Yann Herklotz <git@yannherklotz.com> | 2021-09-22 19:26:01 +0100 |
commit | 2ff1316847b9d338a792f67b7b9f6364d4b65551 (patch) | |
tree | 6aaf069a05f889d6f3fe012332a5e74dd8707429 /benchmarks/polybench-syn-div/medley | |
parent | c114bd7a269824623f2dbb41322d95d5056fca02 (diff) | |
parent | 8386bed39f413bb461c19debbad92e85f927c4b5 (diff) | |
download | vericert-2ff1316847b9d338a792f67b7b9f6364d4b65551.tar.gz vericert-2ff1316847b9d338a792f67b7b9f6364d4b65551.zip |
Merge remote-tracking branch 'origin/develop' into develop
Diffstat (limited to 'benchmarks/polybench-syn-div/medley')
-rw-r--r-- | benchmarks/polybench-syn-div/medley/Makefile | 6 | ||||
-rw-r--r-- | benchmarks/polybench-syn-div/medley/floyd-warshall.c | 91 | ||||
-rw-r--r-- | benchmarks/polybench-syn-div/medley/nussinov.c | 111 |
3 files changed, 208 insertions, 0 deletions
diff --git a/benchmarks/polybench-syn-div/medley/Makefile b/benchmarks/polybench-syn-div/medley/Makefile new file mode 100644 index 0000000..01da9de --- /dev/null +++ b/benchmarks/polybench-syn-div/medley/Makefile @@ -0,0 +1,6 @@ +TARGETS := floyd-warshall nussinov + +include ../common.mk + +floyd-warshall.v: floyd-warshall.c + $(VERICERT) $(VERICERT_OPTS) -O0 -finline $< -o $@ diff --git a/benchmarks/polybench-syn-div/medley/floyd-warshall.c b/benchmarks/polybench-syn-div/medley/floyd-warshall.c new file mode 100644 index 0000000..776d95a --- /dev/null +++ b/benchmarks/polybench-syn-div/medley/floyd-warshall.c @@ -0,0 +1,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; +} diff --git a/benchmarks/polybench-syn-div/medley/nussinov.c b/benchmarks/polybench-syn-div/medley/nussinov.c new file mode 100644 index 0000000..e2e06d3 --- /dev/null +++ b/benchmarks/polybench-syn-div/medley/nussinov.c @@ -0,0 +1,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); + +} |