bones-compiler 1.1.0 → 1.3.1

data/test/examples/benchmarks/PolyBench/gemm_species.c

@@ -0,0 +1,73 @@
+//
+// 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 scop
+	{
+		#pragma species kernel C[0:NI-1,0:NJ-1]|element ^ A[0:NI-1,0:NK-1]|chunk(0:0,0:NK-1) ^ B[0:NK-1,0:NJ-1]|chunk(0:NK-1,0:0) -> C[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_k1
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/test/examples/benchmarks/PolyBench/gemver_species.c

@@ -0,0 +1,93 @@
+//
+// 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 scop
+	{
+		#pragma species kernel A[0:NX-1,0:NX-1]|element ^ u1[0:NX-1]|element ^ v1[0:NX-1]|element ^ u2[0:NX-1]|element ^ v2[0:NX-1]|element -> A[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_k1
+		#pragma species kernel x[0:NX-1]|element ^ A[0:NX-1,0:NX-1]|chunk(0:NX-1,0:0) ^ y[0:NX-1]|full -> x[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_k2
+		#pragma species kernel x[0:NX-1]|element ^ z[0:NX-1]|element -> x[0:NX-1]|element
+		for (i = 0; i < NX; i++) {
+			x[i] = x[i] + z[i];
+		}
+		#pragma species endkernel gemver_k3
+		#pragma species kernel w[0:NX-1]|element ^ A[0:NX-1,0:NX-1]|chunk(0:0,0:NX-1) ^ x[0:NX-1]|full -> w[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_k4
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/test/examples/benchmarks/PolyBench/gesummv_species.c

@@ -0,0 +1,68 @@
+//
+// 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 scop
+	{
+		#pragma species kernel A[0:NX-1,0:NX-1]|chunk(0:0,0:NX-1) ^ x[0:NX-1]|full ^ B[0:NX-1,0:NX-1]|chunk(0:0,0:NX-1) -> tmp[0:NX-1]|element ^ y[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_k1
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/test/examples/benchmarks/PolyBench/gramschmidt_species.c

@@ -0,0 +1,78 @@
+//
+// 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
+	#pragma scop
+	{
+		for (k = 0; k < NJ; k++) {
+			nrm[0] = 0;
+			for (i = 0; i < NI; i++) {
+				nrm[0] += A[i][k] * A[i][k];
+			}
+			R[k][k] = sqrt(nrm[0]);
+			rkk = R[k][k];
+			for (i = 0; i < NI; i++) {
+				Q[i][k] = A[i][k] / rkk;
+			}
+			for (j = k + 1; j < NJ; j++) {
+				R[k][j] = 0;
+				for (i = 0; i < NI; i++) {
+					R[k][j] += Q[i][k] * A[i][j];
+				}
+				rkj = R[k][j];
+				for (i = 0; i < NI; i++) {
+					A[i][j] = A[i][j] - Q[i][k] * rkj;
+				}
+			}
+		}
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}

data/test/examples/benchmarks/PolyBench/jacobi-1d-imper_species.c

@@ -0,0 +1,59 @@
+//
+// 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
+	#pragma scop
+	{
+		for (t = 0; t < TSTEPS; t++) {
+			#pragma species kernel A[0:LARGE_N-1]|neighbourhood(-1:1) -> B[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_k2
+			#pragma species kernel B[1:LARGE_N-2]|element -> A[1:LARGE_N-2]|element
+			for (j = 1; j < LARGE_N - 1; j++) {
+				A[j] = B[j];
+			}
+			#pragma species endkernel jacobi-1d-imper_k3
+		}
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/test/examples/benchmarks/PolyBench/jacobi-2d-imper_species.c

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

data/test/examples/benchmarks/PolyBench/lu_species.c

@@ -0,0 +1,57 @@
+//
+// 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/lu.c
+// Author.............Cedric Nugteren
+// Last modified on...26-Jun-2012
+//
+
+#include "common.h"
+
+// This is 'lu', an LU decomposition kernel
+int main(void) {
+	int i,j,k;
+	
+	// Declare arrays on the stack
+	float A[N][N];
+	
+	// Set the input data
+	for (i=0; i<N; i++) {
+		for (j=0; j<N; j++) {
+			A[i][j] = ((float) (i+1)*(j+1)) / N;
+		}
+	}
+	
+	// Perform the computation
+	#pragma scop
+	{
+		for (k = 0; k < N; k++) {
+			for (j = k + 1; j < N; j++) {
+				A[k][j] = A[k][j] / A[k][k];
+			}
+			for (i = k + 1; i < N; i++) {
+				for (j = k + 1; j < N; j++) {
+					A[i][j] = A[i][j] - A[i][k] * A[k][j];
+				}
+			}
+		}
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+