bones-compiler 1.1.0

data/examples/benchmarks/correlation.c

@@ -0,0 +1,97 @@
+//
+// This file is part of the Bones source-to-source compiler examples. The C-code
+// is largely identical in terms of functionality and variable naming to the code
+// found in PolyBench/C version 3.2. For more information on PolyBench/C or Bones
+// please use the contact information below.
+//
+// == More information on PolyBench/C
+// Contact............Louis-Noel Pouchet <pouchet@cse.ohio-state.edu>
+// Web address........http://polybench.sourceforge.net/
+// 
+// == More information on Bones
+// Contact............Cedric Nugteren <c.nugteren@tue.nl>
+// Web address........http://parse.ele.tue.nl/bones/
+//
+// == File information
+// Filename...........benchmark/correlation.c
+// Author.............Cedric Nugteren
+// Last modified on...26-Jun-2012
+//
+
+#include "common.h"
+
+// This is 'correlation', a correlation computation algorithm
+int main(void) {
+	int i,j,j1,j2;
+	float meanj;
+	
+	// Declare arrays on the stack
+	float data[N][M];
+	float mean[M];
+	float stddev[M];
+	float symmat[M][M];
+	
+	// Set the constants
+	float float_n = 1.2;
+	float eps = 0.1;
+	
+	// Set the input data
+	for (i=0; i<N; i++) {
+		for (j=0; j<M; j++) {
+			data[i][j] = ((float) i*j) / M;
+		}
+	}
+	
+	// Perform the computation
+	// Determine the mean of the column vectors of the input data matrix
+	#pragma species kernel 0:N-1,0:M-1|chunk(0:N-1,0:0) -> 0:M-1|element
+	for (j=0; j<M; j++) {
+		mean[j] = 0.0;
+		for (i=0; i<N; i++) {
+			mean[j] += data[i][j];
+		}
+		mean[j] /= float_n;
+	}
+	#pragma species endkernel correlation-part1
+	#pragma species kernel 0:M-1|element ^ 0:N-1,0:M-1|chunk(0:N-1,0:0) -> 0:M-1|element
+	// Determine the standard deviations of the column vectors of the input data matrix
+	for (j=0; j<M; j++) {
+		stddev[j] = 0.0;
+		meanj = mean[j];
+		for (i=0; i<N; i++) {
+			stddev[j] += (data[i][j] - meanj) * (data[i][j] - meanj);
+		}
+		stddev[j] /= float_n;
+		stddev[j] = sqrt(stddev[j]);
+		stddev[j] = stddev[j] <= eps ? 1.0 : stddev[j];
+	}
+	#pragma species endkernel correlation-part2
+	#pragma species kernel 0:N-1,0:M-1|element ^ 0:M-1|element ^ 0:M-1|element -> 0:N-1,0:M-1|element
+	// Center and reduce the column vectors
+	for (i=0; i<N; i++) {
+		for (j=0; j<M; j++) {
+			data[i][j] -= mean[j];
+			data[i][j] /= sqrt(float_n) * stddev[j];
+		}
+	}
+	#pragma species endkernel correlation-part3
+	// Calculate the MxM correlation matrix
+	for (j1=0; j1<M-1; j1++) {
+		symmat[j1][j1] = 1.0;
+		#pragma species kernel 0:N-1,j1:j1|full ^ 0:N-1,j1+1:M-1|chunk(0:N-1,0:0) -> j1+1:M-1,j1:j1|element ^ j1:j1,j1+1:M-1|element
+		for (j2=j1+1; j2<M; j2++) {
+			symmat[j1][j2] = 0.0;
+			for (i = 0; i<N; i++) {
+				symmat[j1][j2] += (data[i][j1] * data[i][j2]);
+			}
+			symmat[j2][j1] = symmat[j1][j2];
+		}
+		#pragma species endkernel correlation-part4
+	}
+	symmat[M-1][M-1] = 1.0;
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/examples/benchmarks/covariance.c

@@ -0,0 +1,77 @@
+//
+// This file is part of the Bones source-to-source compiler examples. The C-code
+// is largely identical in terms of functionality and variable naming to the code
+// found in PolyBench/C version 3.2. For more information on PolyBench/C or Bones
+// please use the contact information below.
+//
+// == More information on PolyBench/C
+// Contact............Louis-Noel Pouchet <pouchet@cse.ohio-state.edu>
+// Web address........http://polybench.sourceforge.net/
+// 
+// == More information on Bones
+// Contact............Cedric Nugteren <c.nugteren@tue.nl>
+// Web address........http://parse.ele.tue.nl/bones/
+//
+// == File information
+// Filename...........benchmark/covariance.c
+// Author.............Cedric Nugteren
+// Last modified on...26-Jun-2012
+//
+
+#include "common.h"
+
+// This is 'covariance', a covariance computation algorithm
+int main(void) {
+	int i,j,j1,j2;
+	
+	// Declare arrays on the stack
+	float data[N][M];
+	float mean[M];
+	float symmat[M][M];
+	
+	// Set the constants
+	float float_n = 1.2;
+	
+	// Set the input data
+  for (i=0; i<N; i++) {
+		for (j=0; j<M; j++) {
+			data[i][j] = ((float) i*j) / M;
+		}
+	}
+	
+	// Perform the computation
+	#pragma species kernel 0:N-1,0:M-1|chunk(0:N-1,0:0) -> 0:M-1|element
+	// Determine the mean of the column vectors of the input data matrix
+	for (j=0; j<M; j++) {
+		mean[j] = 0.0;
+		for (i=0; i<N; i++) {
+			mean[j] += data[i][j];
+		}
+		mean[j] /= float_n;
+	}
+	#pragma species endkernel covariance-part1
+	#pragma species kernel 0:N-1,0:M-1|element ^ 0:M-1|element -> 0:N-1,0:M-1|element
+	// Center the column vectors
+	for (i=0; i<N; i++) {
+		for (j=0; j<M; j++) {
+			data[i][j] -= mean[j];
+		}
+	}
+	#pragma species endkernel covariance-part2
+	// Calculate the MxM covariance matrix
+	for (j1=0; j1<M; j1++) {
+		#pragma species kernel 0:N-1,j1:j1|full ^ 0:N-1,j1:M-1|chunk(0:N-1,0:0) -> j1:M-1,j1:j1|element ^ j1:j1,j1:M-1|element
+		for (j2=j1; j2<M; j2++) {
+			symmat[j1][j2] = 0.0;
+			for (i=0; i<N; i++) {
+				symmat[j1][j2] += data[i][j1] * data[i][j2];
+			}
+			symmat[j2][j1] = symmat[j1][j2];
+		}
+		#pragma species endkernel covariance-part3
+	}
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}

data/examples/benchmarks/doitgen.c

@@ -0,0 +1,63 @@
+//
+// This file is part of the Bones source-to-source compiler examples. The C-code
+// is largely identical in terms of functionality and variable naming to the code
+// found in PolyBench/C version 3.2. For more information on PolyBench/C or Bones
+// please use the contact information below.
+//
+// == More information on PolyBench/C
+// Contact............Louis-Noel Pouchet <pouchet@cse.ohio-state.edu>
+// Web address........http://polybench.sourceforge.net/
+// 
+// == More information on Bones
+// Contact............Cedric Nugteren <c.nugteren@tue.nl>
+// Web address........http://parse.ele.tue.nl/bones/
+//
+// == File information
+// Filename...........benchmark/doitgen.c
+// Author.............Cedric Nugteren
+// Last modified on...10-April-2012
+//
+
+#include "common.h"
+
+// This is 'doitgen', a multiresolution analysis kernel
+int main(void) {
+	int i,j,k,p,q,r,s;
+	
+	// Declare arrays on the stack
+	float A[NR][NQ][NP];
+	float sum[NR][NQ][NP];
+	float C4[NP][NP];
+	
+	// Set the input data
+	for (i=0; i<NR; i++) { for (j=0; j<NQ; j++) { for (k=0; k<NP; k++) { A[i][j][k] = ((float) i*j + k) / NP; } } }
+	for (i=0; i<NP; i++) { for (j=0; j<NP; j++) { C4[i][j] = ((float) i*j) / NP; } }
+	
+	// Perform the computation
+	#pragma species kernel 0:NR-1,0:NQ-1,0:NP-1|chunk(0:0,0:0,0:NP-1) ^ 0:NP-1,0:NP-1|chunk(0:NP-1,0:0) -> 0:NR-1,0:NQ-1,0:NP-1|element
+	for (r=0; r<NR; r++) {
+		for (q=0; q<NQ; q++) {
+			for (p=0; p<NP; p++) {
+				sum[r][q][p] = 0;
+				for (s=0; s<NP; s++) {
+					sum[r][q][p] = sum[r][q][p] + A[r][q][s] * C4[s][p];
+				}
+			}
+		}
+	}
+	#pragma species endkernel doitgen-part1
+	#pragma species kernel 0:NR-1,0:NQ-1,0:NP-1|element -> 0:NR-1,0:NQ-1,0:NP-1|element
+	for (r=0; r<NR; r++) {
+		for (q=0; q<NQ; q++) {
+			for (p=0; p<NP; p++) {
+				A[r][q][p] = sum[r][q][p];
+			}
+		}
+	}
+	#pragma species endkernel doitgen-part2
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/examples/benchmarks/durbin.c

@@ -0,0 +1,76 @@
+//
+// This file is part of the Bones source-to-source compiler examples. The C-code
+// is largely identical in terms of functionality and variable naming to the code
+// found in PolyBench/C version 3.2. For more information on PolyBench/C or Bones
+// please use the contact information below.
+//
+// == More information on PolyBench/C
+// Contact............Louis-Noel Pouchet <pouchet@cse.ohio-state.edu>
+// Web address........http://polybench.sourceforge.net/
+// 
+// == More information on Bones
+// Contact............Cedric Nugteren <c.nugteren@tue.nl>
+// Web address........http://parse.ele.tue.nl/bones/
+//
+// == File information
+// Filename...........benchmark/durbin.c
+// Author.............Cedric Nugteren
+// Last modified on...03-Jul-2012
+//
+
+#include "common.h"
+
+// This is 'durbin', an algorithm to solve an equation involving a Toeplitz matrix using the Levinson-Durbin recursion
+int main(void) {
+	int i,j,k;
+	float alpha_k;
+	
+	// Declare arrays on the stack
+	float alpha[NX];
+	float beta[NX];
+	float r[NX];
+	float y[NX][NX];
+	float sum[NX][NX];
+	float out[NX];
+	
+	// Set the input data
+	for (i=0; i<NX; i++) {
+		alpha[i] = i;
+		beta[i] = (i+1)/NX/2.0;
+		r[i] = (i+1)/NX/4.0;
+		for (j=0; j<NX; j++) {
+			y[i][j] = ((float) i*j) / NX;
+			sum[i][j] = ((float) i*j) / NX;
+		}
+	}
+	
+	// Perform the computation
+	y[0][0] = r[0];
+	beta[0] = 1;
+	alpha[0] = r[0];
+	for (k=1; k<NX; k++) {
+		beta[k] = beta[k-1] - alpha[k-1] * alpha[k-1] * beta[k-1];
+		sum[0][k] = r[k];
+		for (i=0; i<=k-1; i++) {
+			sum[i+1][k] = sum[i][k] + r[k-i-1] * y[i][k-1];
+		}
+		alpha[k] = -sum[k][k] * beta[k];
+		alpha_k = alpha[k];
+		#pragma species kernel 0:k-1,k-1:k-1|element ^ k-1:0,k-1:k-1|element -> 0:k-1,k:k|element
+		for (i=0; i<=k-1; i++) {
+			y[i][k] = y[i][k-1] + alpha_k * y[k-i-1][k-1];
+		}
+		#pragma species endkernel durbin-part1
+		y[k][k] = alpha[k];
+	}
+	#pragma species kernel 0:NX-1,NX-1:NX-1|element -> 0:NX-1|element
+	for (i=0; i<NX; i++) {
+		out[i] = y[i][NX-1];
+	}
+	#pragma species endkernel durbin-part2
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/examples/benchmarks/dynprog.c

@@ -0,0 +1,67 @@
+//
+// This file is part of the Bones source-to-source compiler examples. The C-code
+// is largely identical in terms of functionality and variable naming to the code
+// found in PolyBench/C version 3.2. For more information on PolyBench/C or Bones
+// please use the contact information below.
+//
+// == More information on PolyBench/C
+// Contact............Louis-Noel Pouchet <pouchet@cse.ohio-state.edu>
+// Web address........http://polybench.sourceforge.net/
+// 
+// == More information on Bones
+// Contact............Cedric Nugteren <c.nugteren@tue.nl>
+// Web address........http://parse.ele.tue.nl/bones/
+//
+// == File information
+// Filename...........benchmark/dynprog.c
+// Author.............Cedric Nugteren
+// Last modified on...29-May-2012
+//
+
+#include "common.h"
+
+// This is 'dynprog', a 2D dynamic programming algorithm
+int main(void) {
+	int i,j,k,iter;
+	
+	// Declare arrays on the stack
+	float C[LENGTH][LENGTH];
+	float W[LENGTH][LENGTH];
+	float c[LENGTH][LENGTH];
+	float sum_c[LENGTH][LENGTH][LENGTH];
+	float out;
+	
+	// Set the input data
+	for (i=0; i<LENGTH; i++) {
+		for (j=0; j<LENGTH; j++) {
+			C[i][j] = i*j % 2;
+			W[i][j] = ((float) i-j) / LENGTH;
+		}
+	}
+	
+	// Perform the computation
+	for (iter=0; iter<ITER; iter++) {
+		#pragma species kernel 0:0|void -> 0:LENGTH-1,0:LENGTH-1|element
+		for (i=0; i<=LENGTH-1; i++) {
+			for (j=0; j<=LENGTH-1; j++) {
+				c[i][j] = 0;
+			}
+		}
+		#pragma species endkernel dynprog
+		for (i=0; i<=LENGTH-2; i++) {
+			for (j=i+1; j<=LENGTH-1; j++) {
+				sum_c[i][j][i] = 0;
+				for (k=i+1; k<=j-1; k++) {
+					sum_c[i][j][k] = sum_c[i][j][k - 1] + c[i][k] + c[k][j];
+				}
+				c[i][j] = sum_c[i][j][j-1] + W[i][j];
+			}
+		}
+		out += c[0][LENGTH-1];
+	}
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/examples/benchmarks/fdtd-2d-apml.c

@@ -0,0 +1,114 @@
+//
+// This file is part of the Bones source-to-source compiler examples. The C-code
+// is largely identical in terms of functionality and variable naming to the code
+// found in PolyBench/C version 3.2. For more information on PolyBench/C or Bones
+// please use the contact information below.
+//
+// == More information on PolyBench/C
+// Contact............Louis-Noel Pouchet <pouchet@cse.ohio-state.edu>
+// Web address........http://polybench.sourceforge.net/
+// 
+// == More information on Bones
+// Contact............Cedric Nugteren <c.nugteren@tue.nl>
+// Web address........http://parse.ele.tue.nl/bones/
+//
+// == File information
+// Filename...........benchmark/fdtd-2d-apml.c
+// Author.............Cedric Nugteren
+// Last modified on...30-May-2012
+//
+
+#include "common.h"
+
+// This is 'fdtd-2d-apml', a 2D finite different time domain kernel using an anisotropic perfectly matched layer
+int main(void) {
+	int i,j,k;
+	int ix,iy,iz;
+	float clf, tmp;
+	float czm_iz, czp_iz;
+	float cymh_iy, cyph_iy;
+	
+	// Declare arrays on the stack
+	float czm[CZ+1];
+	float czp[CZ+1];
+	float cxmh[CXM+1];
+	float cxph[CXM+1];
+	float cymh[CYM+1];
+	float cyph[CYM+1];
+	float Ry[CZ+1][CYM+1];
+	float Ax[CZ+1][CYM+1];
+	float Ex[CZ+1][CYM+1][CXM+1];
+	float Ey[CZ+1][CYM+1][CXM+1];
+	float Hz[CZ+1][CYM+1][CXM+1];
+	float Bza[CZ+1][CYM+1][CXM+1];
+	
+	// Set the constants
+	float mui = 2341;
+	float ch = 42;
+	
+	// Set the input data
+	for (i=0; i<=CZ; i++) {
+		czm[i] = ((float) i+1) / CXM;
+		czp[i] = ((float) i+2) / CXM;
+	}
+	for (i=0; i<=CXM; i++) {
+		cxmh[i] = ((float) i+3) / CXM;
+		cxph[i] = ((float) i+4) / CXM;
+	}
+	for (i=0; i<=CYM; i++) {
+		cymh[i] = ((float) i+5) / CXM;
+		cyph[i] = ((float) i+6) / CXM;
+	}
+	for (i=0; i<=CZ; i++) {
+		for (j=0; j<=CYM; j++) {
+			Ry[i][j] = ((float) i*(j+1) + 10) / CYM;
+			Ax[i][j] = ((float) i*(j+2) + 11) / CYM;
+			for (k=0; k<=CXM; k++) {
+				Ex[i][j][k] = ((float) i*(j+3) + k+1) / CXM;
+				Ey[i][j][k] = ((float) i*(j+4) + k+2) / CYM;
+				Hz[i][j][k] = ((float) i*(j+5) + k+3) / CZ;
+			}
+		}
+	}
+	
+	// Perform the computation
+	for (iz=0; iz<CZ; iz++) {
+		for (iy=0; iy<CYM; iy++) {
+			czm_iz = czm[iz];
+			czp_iz = czp[iz];
+			cymh_iy = cymh[iy];
+			cyph_iy = cyph[iy];
+			
+			#pragma species kernel iz:iz,iy:iy+1,0:CXM-1|chunk(0:0,0:1,0:0) ^ iz:iz,iy:iy,0:CXM-1|neighbourhood(0:0,0:0,0:1) ^ iz:iz,iy:iy,0:CXM-1|element  ^ iz:iz,iy:iy,0:CXM-1|element ^ 0:CXM-1|element ^ 0:CXM-1|element -> iz:iz,iy:iy,0:CXM-1|element ^ iz:iz,iy:iy,0:CXM-1|element
+			for (ix=0; ix<CXM; ix++) {
+				clf = Ex[iz][iy][ix] - Ex[iz][iy+1][ix] + Ey[iz][iy][ix+1] - Ey[iz][iy][ix];
+				tmp = (cymh_iy/cyph_iy) * Bza[iz][iy][ix] - (ch/cyph_iy) * clf;
+				Hz[iz][iy][ix] = Hz[iz][iy][ix] * (cxmh[ix]/cxph[ix]) + (mui * czp_iz/cxph[ix]) * tmp - (mui * czm_iz/cxph[ix]) * Bza[iz][iy][ix];
+				Bza[iz][iy][ix] = tmp;
+			}
+			#pragma species endkernel fdtd-2d-apml
+			
+			clf = Ex[iz][iy][CXM] - Ex[iz][iy+1][CXM] + Ry[iz][iy] - Ey[iz][iy][CXM];
+			tmp = (cymh_iy/cyph_iy) * Bza[iz][iy][CXM] - (ch/cyph_iy) * clf;
+			Hz[iz][iy][CXM] = (cxmh[CXM]/cxph[CXM]) * Hz[iz][iy][CXM] + (mui * czp_iz/cxph[CXM]) * tmp - (mui * czm_iz/cxph[CXM]) * Bza[iz][iy][CXM];
+			Bza[iz][iy][CXM] = tmp;
+			
+			for (ix=0; ix<CXM; ix++) {
+				clf = Ex[iz][CYM][ix] - Ax[iz][ix] + Ey[iz][CYM][ix+1] - Ey[iz][CYM][ix];
+				tmp = (cymh[CYM]/cyph_iy) * Bza[iz][iy][ix] - (ch/cyph_iy) * clf;
+				Hz[iz][CYM][ix] = (cxmh[ix]/cxph[ix]) * Hz[iz][CYM][ix] + (mui * czp_iz/cxph[ix]) * tmp - (mui * czm_iz/cxph[ix]) * Bza[iz][CYM][ix];
+				Bza[iz][CYM][ix] = tmp;
+			}
+			
+			clf = Ex[iz][CYM][CXM] - Ax[iz][CXM] + Ry[iz][CYM] - Ey[iz][CYM][CXM];
+			tmp = (cymh[CYM]/cyph[CYM]) * Bza[iz][CYM][CXM] - (ch/cyph[CYM]) * clf;
+			Hz[iz][CYM][CXM] = (cxmh[CXM]/cxph[CXM]) * Hz[iz][CYM][CXM] + (mui * czp_iz/cxph[CXM]) * tmp - (mui * czm_iz/cxph[CXM]) * Bza[iz][CYM][CXM];
+			Bza[iz][CYM][CXM] = tmp;
+		}
+	}
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+