diff options
author | Yann Herklotz <git@yannherklotz.com> | 2021-07-11 01:19:52 +0200 |
---|---|---|
committer | Yann Herklotz <git@yannherklotz.com> | 2021-07-11 01:19:52 +0200 |
commit | aa986aacbb80e9f92f77d65de74ba5051054eac7 (patch) | |
tree | 0a1a6c9f209e818f7a1ec675ae8983abc5b9de2c /benchmarks/polybench-syn-div/stencils/jacobi-1d.c | |
parent | f46b0cd924705dcb4817129bb0504767c2225c20 (diff) | |
download | vericert-aa986aacbb80e9f92f77d65de74ba5051054eac7.tar.gz vericert-aa986aacbb80e9f92f77d65de74ba5051054eac7.zip |
Add divider benchmarks
Diffstat (limited to 'benchmarks/polybench-syn-div/stencils/jacobi-1d.c')
-rw-r--r-- | benchmarks/polybench-syn-div/stencils/jacobi-1d.c | 101 |
1 files changed, 101 insertions, 0 deletions
diff --git a/benchmarks/polybench-syn-div/stencils/jacobi-1d.c b/benchmarks/polybench-syn-div/stencils/jacobi-1d.c new file mode 100644 index 0000000..993773e --- /dev/null +++ b/benchmarks/polybench-syn-div/stencils/jacobi-1d.c @@ -0,0 +1,101 @@ +/** + * 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 + */ +/* jacobi-1d.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 A[ 30 + 0], + int B[ 30 + 0]) +{ + int i; + int ONE = 1; + int TWO = 2; + int THREE = 3; + + for (i = 0; i < n; plus(i)) + { + A[i] = (((int) i+TWO) / n); + B[i] = (((int) i+THREE) / n); + } +} + + + + +static +int print_array(int n, + int A[ 30 + 0]) + +{ + int i; + int ONE = 1; + int res = 0; + + for (i = 0; i < n; plus(i)) + { + res ^= A[i]; + } +#ifndef SYNTHESIS + printf("finished %u\n", res); +#endif + return res; +} + + + + +static +void kernel_jacobi_1d(int tsteps, + int n, + int A[ 30 + 0], + int B[ 30 + 0]) +{ + int t, i; + int ONE = 1; + + for (t = 0; t < tsteps; plus(t)) + { + for (i = 1; i < n - ONE; plus(i)){ + B[i] = (A[i-ONE] + A[i] + A[i + ONE]); + B[i] = B[i] >> 2; + } + for (i = 1; i < n - ONE; plus(i)){ + A[i] = (B[i-ONE] + B[i] + B[i + ONE]); + A[i] = A[i] >> 2; + } + } + +} + + +int main() +{ + + int n = 30; + int tsteps = 20; + + + int A[30 + 0]; + int B[30 + 0]; + + + + init_array (n, A, B); + + kernel_jacobi_1d(tsteps, n, A, B); + + return print_array(n, A); + +} |