bones-compiler 1.1.0

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

@@ -0,0 +1,74 @@
+//
+// 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.c
+// Author.............Cedric Nugteren
+// Last modified on...08-May-2012
+//
+
+#include "common.h"
+
+// This is 'fdtd-2d', a 2D finite different time domain kernel
+int main(void) {
+	int i,j,t;
+	
+	// Declare arrays on the stack
+	float ex[NI][NJ];
+	float ey[NI][NJ];
+	float hz[NI][NJ];
+	
+	// Set the input data
+	for (i=0; i<NI; i++) {
+		for (j=0; j<NJ; j++) {
+			ex[i][j] = ((float) i*(j+1)) / NI;
+			ey[i][j] = ((float) i*(j+2)) / NJ;
+			hz[i][j] = ((float) i*(j+3)) / NI;
+		}
+	}
+	
+	// Perform the computation
+	for (t=0; t<TSTEPS; t++) {
+		#pragma species kernel 0:0|void -> 0:0,0:NJ-1|element
+		for (j=0; j<NJ; j++) {
+			ey[0][j] = t;
+		}
+		#pragma species endkernel fdtd-2d-part1
+		#pragma species kernel 1:NI-1,0:NJ-1|element ^ 1:NI-1,0:NJ-1|neighbourhood(-1:0,0:0) -> 1:NI-1,0:NJ-1|element
+		for (i=1; i<NI; i++) {
+			for (j=0; j<NJ; j++) {
+				ey[i][j] = ey[i][j] - 0.5*(hz[i][j] - hz[i-1][j]);
+			}
+		}
+		#pragma species endkernel fdtd-2d-part2
+		#pragma species kernel 0:NI-1,1:NJ-1|element ^ 0:NI-1,1:NJ-1|neighbourhood(0:0,-1:0) -> 0:NI-1,1:NJ-1|element
+		for (i=0; i<NI; i++) {
+			for (j=1; j<NJ; j++) {
+				ex[i][j] = ex[i][j] - 0.5*(hz[i][j] - hz[i][j-1]);
+			}
+		}
+		#pragma species endkernel fdtd-2d-part3
+		#pragma species kernel 0:NI-2,0:NJ-2|element ^ 0:NI-2,0:NJ-2|neighbourhood(0:0,0:1) ^ 0:NI-2,0:NJ-2|neighbourhood(0:1,0:0) -> 0:NI-2,0:NJ-2|element
+		for (i=0; i<NI-1; i++) {
+			for (j=0; j<NJ-1; j++) {
+				hz[i][j] = hz[i][j] - 0.7*(ex[i][j+1] - ex[i][j] + ey[i+1][j] - ey[i][j]);
+			}
+		}
+		#pragma species endkernel fdtd-2d-part4
+	}
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}

data/examples/benchmarks/floyd-warshall.c

@@ -0,0 +1,50 @@
+//
+// 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/floyd-warshall.c
+// Author.............Cedric Nugteren
+// Last modified on...10-April-2012
+//
+
+#include "common.h"
+
+// This is 'floyd-warshall', a graph analysis algorithm to find shortest paths in a weighted graph
+int main(void) {
+	int i,j,k;
+	
+	// Declare arrays on the stack
+	float path[N][N];
+	
+	// Set the input data
+	for (i=0; i<N; i++) {
+		for (j=0; j<N; j++) {
+			path[i][j] = ((float) (i+1)*(j+1)) / N;
+		}
+	}
+	
+	// Perform the computation
+	for (k=0; k<N; k++) {
+		for (i=0; i<N; i++) {
+			for (j=0; j<N; j++) {
+				path[i][j] = (path[i][j] < path[i][k]+path[k][j]) ? path[i][j] : path[i][k]+path[k][j];
+			}
+		}
+	}
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/examples/benchmarks/gemm.c

@@ -0,0 +1,69 @@
+//
+// 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/gemm.c
+// Author.............Cedric Nugteren
+// Last modified on...04-April-2012
+//
+
+#include "common.h"
+
+// This is 'gemm', a general matrix multiplication kernel
+int main(void) {
+	int i,j,k;
+	
+	// Declare arrays on the stack
+	float A[NI][NK];
+	float B[NK][NJ];
+	float C[NI][NJ];
+	
+	// Set the constants
+	int alpha = 32412;
+	int beta = 2123;
+	
+	// Set the input data
+	for (i=0; i<NI; i++) {
+		for (j=0; j<NK; j++) {
+			A[i][j] = ((float) i*j) / NI;
+		}
+	}
+	for (i=0; i<NK; i++) {
+		for (j=0; j<NJ; j++) {
+			B[i][j] = ((float) i*j) / NI;
+		}
+	}
+	for (i=0; i<NI; i++) {
+		for (j=0; j<NJ; j++) {
+			C[i][j] = ((float) i*j) / NI;
+		}
+	}
+	
+	// Perform the computation (C := alpha*A*B + beta*C)
+	#pragma species kernel 0:NI-1,0:NJ-1|element ^ 0:NI-1,0:NK-1|chunk(0:0,0:NK-1) ^ 0:NK-1,0:NJ-1|chunk(0:NK-1,0:0) -> 0:NI-1,0:NJ-1|element
+	for (i=0; i<NI; i++) {
+		for (j=0; j<NJ; j++) {
+			C[i][j] *= beta;
+			for (k=0; k<NK; k++) {
+				C[i][j] += alpha * A[i][k] * B[k][j];
+			}
+		}
+	}
+	#pragma species endkernel gemm
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/examples/benchmarks/gemver.c

@@ -0,0 +1,89 @@
+//
+// 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/gemver.c
+// Author.............Cedric Nugteren
+// Last modified on...04-April-2012
+//
+
+#include "common.h"
+
+// This is 'gemver', a general matrix vector multiplication and matrix addition kernel
+int main(void) {
+	int i,j;
+	
+	// Declare arrays on the stack
+	float A[NX][NX];
+	float u1[NX];
+	float u2[NX];
+	float v1[NX];
+	float v2[NX];
+	float w[NX];
+	float x[NX];
+	float y[NX];
+	float z[NX];
+	
+	// Set the constants
+	int alpha = 43532;
+	int beta = 12313;
+	
+	// Set the input data
+	for (i=0; i<NX; i++) {
+		u1[i] = i;
+		u2[i] = (i+1)/NX/2.0;
+		v1[i] = (i+1)/NX/4.0;
+		v2[i] = (i+1)/NX/6.0;
+		w[i] = 0.0;
+		x[i] = 0.0;
+		y[i] = (i+1)/NX/8.0;
+		z[i] = (i+1)/NX/9.0;
+		for (j=0; j<NX; j++) {
+			A[i][j] = ((float) i*j) / NX;
+		}
+	}
+	
+	// Perform the computation
+	#pragma species kernel 0:NX-1,0:NX-1|element ^ 0:NX-1|element ^ 0:NX-1|element ^ 0:NX-1|element ^ 0:NX-1|element -> 0:NX-1,0:NX-1|element
+	for (i=0; i<NX; i++) {
+		for (j=0; j<NX; j++) {
+			A[i][j] = A[i][j] + u1[i] * v1[j] + u2[i] * v2[j];
+		}
+	}
+	#pragma species endkernel gemver-part1
+	#pragma species kernel 0:NX-1|element ^ 0:NX-1,0:NX-1|chunk(0:NX-1,0:0) ^ 0:NX-1|full -> 0:NX-1|element
+	for (i=0; i<NX; i++) {
+		for (j=0; j<NX; j++) {
+			x[i] = x[i] + beta * A[j][i] * y[j];
+		}
+	}
+	#pragma species endkernel gemver-part2
+	#pragma species kernel 0:NX-1|element ^ 0:NX-1|element -> 0:NX-1|element
+	for (i=0; i<NX; i++) {
+		x[i] = x[i] + z[i];
+	}
+	#pragma species endkernel gemver-part3
+	#pragma species kernel 0:NX-1|element ^ 0:NX-1,0:NX-1|chunk(0:0,0:NX-1) ^ 0:NX-1|full -> 0:NX-1|element
+	for (i=0; i<NX; i++) {
+		for (j=0; j<NX; j++) {
+			w[i] = w[i] +  alpha * A[i][j] * x[j];
+		}
+	}
+	#pragma species endkernel gemver-part4
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/examples/benchmarks/gesummv.c

@@ -0,0 +1,64 @@
+//
+// 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/gesummv.c
+// Author.............Cedric Nugteren
+// Last modified on...20-Jul-2012
+//
+
+#include "common.h"
+
+// This is 'gesummv', a general scalar, vector and matrix multiplication kernel
+int main(void) {
+	int i,j;
+	
+	// Declare arrays on the stack
+	float A[NX][NX];
+	float B[NX][NX];
+	float x[NX];
+	float y[NX];
+	float tmp[NX];
+	
+	// Set the constants
+	float alpha = 43532;
+	float beta = 12313;
+	
+	// Set the input data
+	for (i=0; i<NX; i++) {
+		x[i] = ((float) i) / NX;
+		for (j=0; j<NX; j++) {
+			A[i][j] = ((float) i*(j+1)) / NX;
+			B[i][j] = ((float) (i+3)*j) / NX;
+		}
+	}
+	
+	// Perform the computation
+	#pragma species kernel 0:NX-1,0:NX-1|chunk(0:0,0:NX-1) ^ 0:NX-1|full ^ 0:NX-1,0:NX-1|chunk(0:0,0:NX-1) -> 0:NX-1|element ^ 0:NX-1|element
+	for (i=0; i<NX; i++) {
+		tmp[i] = 0;
+		y[i] = 0;
+		for (j=0; j<NX; j++) {
+			tmp[i] = A[i][j] * x[j] + tmp[i];
+			y[i] = B[i][j] * x[j] + y[i];
+		}
+		y[i] = alpha*tmp[i] + beta*y[i];
+	}
+	#pragma species endkernel gesummv
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/examples/benchmarks/gramschmidt.c

@@ -0,0 +1,84 @@
+//
+// 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/gramschmidt.c
+// Author.............Cedric Nugteren
+// Last modified on...26-Jun-2012
+//
+
+#include "common.h"
+
+// This is 'gramschmidt', an algorithm for the Gram-Schmidt process
+int main(void) {
+	int i,j,k;
+	float nrm[1];
+	float rkk;
+	float rkj;
+	
+	// Declare arrays on the stack
+	float A[NI][NJ];
+	float R[NJ][NJ];
+	float Q[NI][NJ];
+	
+	// Set the input data
+	for (i=0; i<NI; i++) {
+		for (j=0; j<NJ; j++) {
+			A[i][j] = ((float) i*j) / NI + 1;
+			Q[i][j] = ((float) i*(j+1)) / NJ;
+		}
+	}
+	for (i=0; i<NJ; i++) {
+		for (j=0; j<NJ; j++) {
+			R[i][j] = ((float) i*(j+2)) / NJ;
+		}
+	}
+	
+	// Perform the computation
+	for (k=0; k<NJ; k++) {
+		nrm[0] = 0;
+		#pragma species kernel 0:NI-1,k:k|element -> 0:0|shared
+		for (i=0; i<NI; i++) {
+			nrm[0] += A[i][k] * A[i][k];
+		}
+		#pragma species endkernel gramschmidt-part1
+		R[k][k] = sqrt(nrm[0]);
+		rkk = R[k][k];
+		#pragma species kernel 0:NI-1,k:k|element -> 0:NI-1,k:k|element
+		for (i=0; i<NI; i++) {
+			Q[i][k] = A[i][k] / rkk;
+		}
+		#pragma species endkernel gramschmidt-part2
+		#pragma species kernel 0:NI-1,k:k|element ^ 0:NI-1,k+1:NJ-1|element -> 0:NI-1,k+1:NJ-1|element ^ k:k,k+1:NJ-1|element
+		for (j=k+1; j<NJ; j++) {
+			R[k][j] = 0;
+			#pragma species kernel 0:NI-1,k:k|element ^ 0:NI-1,j:j|element -> k:k,j:j|shared
+			for (i=0; i<NI; i++) {
+				R[k][j] += Q[i][k] * A[i][j];
+			}
+			#pragma species endkernel gramschmidt-part3a
+			rkj = R[k][j];
+			#pragma species kernel 0:NI-1,j:j|element ^ 0:NI-1,k:k|element -> 0:NI-1,j:j|element 
+			for (i=0; i<NI; i++) {
+				A[i][j] = A[i][j] - Q[i][k] * rkj;
+			}
+			#pragma species endkernel gramschmidt-part3b
+		}
+		#pragma species endkernel gramschmidt-part3
+	}
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}

data/examples/benchmarks/jacobi-1d-imper.c

@@ -0,0 +1,55 @@
+//
+// 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/jacobi-1d-imper.c
+// Author.............Cedric Nugteren
+// Last modified on...03-April-2012
+//
+
+#include "common.h"
+
+// This is 'jacobi-1d-imper', a 1D Jacobi stencil computation
+int main(void) {
+	int i,j,t;
+	
+	// Declare arrays on the stack
+	float A[LARGE_N];
+	float B[LARGE_N];
+	
+	// Set the input data
+	for (i=0; i<LARGE_N; i++) {
+		A[i] = ((float) i+2) / LARGE_N;
+		B[i] = ((float) i+3) / LARGE_N;
+	}
+	
+	// Perform the computation
+	for (t=0; t<TSTEPS; t++) {
+		#pragma species kernel 1:LARGE_N-2|neighbourhood(-1:1) -> 1:LARGE_N-2|element
+		for (i=1; i<LARGE_N-1; i++) {
+			B[i] = 0.33333 * (A[i-1] + A[i] + A[i+1]);
+		}
+		#pragma species endkernel jacobi-1d-imper-part1
+		#pragma species kernel 1:LARGE_N-2|element -> 1:LARGE_N-2|element
+		for (j=1; j<LARGE_N-1; j++) {
+			A[j] = B[j];
+		}
+		#pragma species endkernel jacobi-1d-imper-part2
+	}
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+