bones-compiler 1.1.0 → 1.3.1

data/test/examples/benchmarks/PolyBench/ludcmp_species.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/ludcmp.c
+// Author.............Cedric Nugteren
+// Last modified on...23-May-2012
+//
+
+#include "common.h"
+
+// This is 'ludcmp', an LU decomposition kernel
+int main(void) {
+	int i,j,k;
+	float w[1];
+	
+	// Declare arrays on the stack
+	float A[N+1][N+1];
+	float b[N+1];
+	float x[N+1];
+	float y[N+1];
+	
+	// Set the input data
+	for (i=0; i<=N; i++) {
+		x[i] = i+1;
+		y[i] = (i+1)/(float)(N*40) + 1;
+		b[i] = (i+1)/(float)(N*20) + 42;
+		for (j=0; j<=N; j++) {
+			A[i][j] = (i+1)/(float)(10*N) + (j+1)/(float)(5*N);
+		}
+	}
+	
+	// Perform the computation
+	#pragma scop
+	{
+		b[0] = 1.0;
+		for (i = 0; i < N; i++) {
+			for (j = i + 1; j <= N; j++) {
+				w[0] = A[j][i];
+				for (k = 0; k < i; k++) {
+					w[0] = w[0] - A[j][k] * A[k][i];
+				}
+				A[j][i] = w[0] / A[i][i];
+			}
+			for (j = i + 1; j <= N; j++) {
+				w[0] = A[i + 1][j];
+				for (k = 0; k <= i; k++) {
+					w[0] = w[0] - A[i + 1][k] * A[k][j];
+				}
+				A[i + 1][j] = w[0];
+			}
+		}
+		y[0] = b[0];
+		for (i = 1; i <= N; i++) {
+			w[0] = b[i];
+			#pragma species kernel w[0:0]|full ^ A[i:i,0:i-1]|element ^ y[0:i-1]|element -> w[0:0]|shared
+			for (j = 0; j < i; j++) {
+				w[0] = w[0] - A[i][j] * y[j];
+			}
+			#pragma species endkernel ludcmp_k18
+			y[i] = w[0];
+		}
+		x[N] = y[N] / A[N][N];
+		for (i = 0; i <= N - 1; i++) {
+			w[0] = y[N - 1 - i];
+			for (j = N - i; j <= N; j++) {
+				w[0] = w[0] - A[N - 1 - i][j] * x[j];
+			}
+			x[N - 1 - i] = w[0] / A[N - 1 - i][N - 1 - i];
+		}
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/test/examples/benchmarks/PolyBench/mvt_species.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/mvt.c
+// Author.............Cedric Nugteren
+// Last modified on...23-May-2012
+//
+
+#include "common.h"
+
+// This is 'mvt', a matrix vector product and transpose kernel
+int main(void) {
+	int i,j;
+	
+	// Declare arrays on the stack
+	float A[NX][NX];
+	float x1[NX];
+	float x2[NX];
+	float y_1[NX];
+	float y_2[NX];
+	
+	// Set the input data
+	for (i=0; i<NX; i++) {
+		x1[i] = ((float) i) / NX;
+		x2[i] = ((float) i + 1) / NX;
+		y_1[i] = ((float) i + 3) / NX;
+		y_2[i] = ((float) i + 4) / NX;
+		for (j=0; j<NX; j++) {
+			A[i][j] = ((float) i*j) / NX;
+		}
+	}
+	
+	// Perform the computation
+	#pragma scop
+	{
+		#pragma species kernel x1[0:NX-1]|element ^ A[0:NX-1,0:NX-1]|chunk(0:0,0:NX-1) ^ y_1[0:NX-1]|full -> x1[0:NX-1]|element
+		for (i = 0; i < NX; i++) {
+			for (j = 0; j < NX; j++) {
+				x1[i] = x1[i] + A[i][j] * y_1[j];
+			}
+		}
+		#pragma species endkernel mvt_k1
+		#pragma species kernel x2[0:NX-1]|element ^ A[0:NX-1,0:NX-1]|chunk(0:NX-1,0:0) ^ y_2[0:NX-1]|full -> x2[0:NX-1]|element
+		for (i = 0; i < NX; i++) {
+			for (j = 0; j < NX; j++) {
+				x2[i] = x2[i] + A[j][i] * y_2[j];
+			}
+		}
+		#pragma species endkernel mvt_k2
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

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

@@ -0,0 +1,86 @@
+//
+// 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/reg_detect.c
+// Author.............Cedric Nugteren
+// Last modified on...26-Jun-2012
+//
+
+#include "common.h"
+
+// This is 'reg_detect', a regularity detection algorithm
+int main(void) {
+	int i,j,t,cnt;
+	float sum;
+	
+	// Declare arrays on the stack
+	float sum_tang[MAXGRID][MAXGRID];
+	float mean[MAXGRID][MAXGRID];
+	float path[MAXGRID][MAXGRID];
+	float diff[MAXGRID][MAXGRID][LENGTH];
+	float sum_diff[MAXGRID][MAXGRID][LENGTH];
+	
+	// Set the input data
+	for (i=0; i<MAXGRID; i++) {
+		for (j=0; j<MAXGRID; j++) {
+			sum_tang[i][j] = (float)((i+1)*(j+1));
+			mean[i][j] = ((float) i-j) / MAXGRID;
+			path[i][j] = ((float) i*(j-1)) / MAXGRID;
+		}
+	}
+	
+	// Perform the computation
+	#pragma scop
+	{
+		for (t = 0; t < ITER; t++) {
+			#pragma species kernel sum_tang[0:MAXGRID-1,0:MAXGRID-1]|element -> diff[0:MAXGRID-1,0:MAXGRID-1,0:LENGTH-1]|chunk(0:0,0:0,0:LENGTH-1)
+			for (j = 0; j <= MAXGRID - 1; j++) {
+				for (i = 0; i <= MAXGRID - 1; i++) {
+					sum = sum_tang[j][i];
+					for (cnt = 0; cnt <= LENGTH - 1; cnt++) {
+						diff[j][i][cnt] = sum;
+					}
+				}
+			}
+			#pragma species endkernel reg_detect_k2
+			for (j = 0; j <= MAXGRID - 1; j++) {
+				for (i = j; i <= MAXGRID - 1; i++) {
+					sum_diff[j][i][0] = diff[j][i][0];
+					for (cnt = 1; cnt <= LENGTH - 1; cnt++) {
+						sum_diff[j][i][cnt] = sum_diff[j][i][cnt - 1] + diff[j][i][cnt];
+					}
+					mean[j][i] = sum_diff[j][i][LENGTH - 1];
+				}
+			}
+			#pragma species kernel mean[0:0,0:MAXGRID-1]|element -> path[0:0,0:MAXGRID-1]|element
+			for (i = 0; i <= MAXGRID - 1; i++) {
+				path[0][i] = mean[0][i];
+			}
+			#pragma species endkernel reg_detect_k4
+			for (j = 1; j <= MAXGRID - 1; j++) {
+				#pragma species kernel path[j-1:j-1,j-1:MAXGRID-2]|element ^ mean[j:j,j:MAXGRID-1]|element -> path[j:j,j:MAXGRID-1]|element
+				for (i = j; i <= MAXGRID - 1; i++) {
+					path[j][i] = path[j - 1][i - 1] + mean[j][i];
+				}
+				#pragma species endkernel reg_detect_k16
+			}
+		}
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}

data/test/examples/benchmarks/PolyBench/seidel-2d_species.c

@@ -0,0 +1,53 @@
+//
+// 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/seidel-2d.c
+// Author.............Cedric Nugteren
+// Last modified on...05-April-2012
+//
+
+#include "common.h"
+
+// This is 'seidel-2d', a 2D Seidel stencil computation
+int main(void) {
+	int i,j,t;
+	
+	// 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*i*(j+2) + 2) / N;
+		}
+	}
+	
+	// Perform the computation
+	#pragma scop
+	{
+		for (t = 0; t < TSTEPS - 1; t++) {
+			for (i = 1; i <= N - 2; i++) {
+				for (j = 1; j <= N - 2; j++) {
+					A[i][j] = (A[i - 1][j - 1] + A[i - 1][j] + A[i - 1][j + 1] + A[i][j - 1] + A[i][j] + A[i][j + 1] + A[i + 1][j - 1] + A[i + 1][j] + A[i + 1][j + 1]) / 9.0;
+				}
+			}
+		}
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}

data/test/examples/benchmarks/PolyBench/symm_species.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/symm.c
+// Author.............Cedric Nugteren
+// Last modified on...23-May-2012
+//
+
+#include "common.h"
+
+// This is 'symm', a symmetric matrix multiplication kernel
+int main(void) {
+	int i,j,k;
+	float acc[1];
+	float bij;
+	
+	// Declare arrays on the stack
+	float A[NJ][NJ];
+	float B[NI][NJ];
+	float C[NI][NJ];
+	
+	// Set the constants
+	float alpha = 32412;
+	float beta = 2123;
+	
+	// Set the input data
+	for (i=0; i<NI; i++) {
+		for (j=0; j<NJ; j++) {
+			C[i][j] = ((float) i*j) / NI;
+			B[i][j] = ((float) i*j) / NI;
+		}
+	}
+	for (i=0; i<NJ; i++) {
+		for (j=0; j<NJ; j++) {
+			A[i][j] = ((float) i*j) / NI;
+		}
+	}
+	
+	// Perform the computation (C := alpha*A*B + beta*C, with A symmetric)
+	#pragma scop
+	{
+		for (i = 0; i < NI; i++) {
+			for (j = 0; j < NJ; j++) {
+				acc[0] = 0;
+				bij = B[i][j];
+				for (k = 0; k < j - 1; k++) {
+					C[k][j] += alpha * A[k][i] * bij;
+				}
+				for (k = 0; k < j - 1; k++) {
+					acc[0] += B[k][j] * A[k][i];
+				}
+				C[i][j] = beta * C[i][j] + alpha * A[i][i] * bij + alpha * acc[0];
+			}
+		}
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/test/examples/benchmarks/PolyBench/syr2k_species.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/syr2k.c
+// Author.............Cedric Nugteren
+// Last modified on...03-April-2012
+//
+
+#include "common.h"
+
+// This is 'syr2k', an algorithm for symmetric rank-2k operations
+int main(void) {
+	int i,j,k;
+	
+	// Declare arrays on the stack
+	float A[NI][NJ];
+	float B[NI][NJ];
+	float C[NI][NI];
+	
+	// Set the constants
+	int alpha = 32412;
+	int beta = 2123;
+	
+	// Set the input data
+	for (i=0; i<NI; i++) {
+		for (j=0; j<NJ; j++) {
+			A[i][j] = ((float) i*j) / NI;
+			B[i][j] = ((float) i*j) / NI;
+		}
+	}
+	for (i=0; i<NI; i++) {
+		for (j=0; j<NI; j++) {
+			C[i][j] = ((float) i*j) / NI;
+		}
+	}
+	
+	// Perform the computation (C := alpha*A*B' + alpha*B*A' + beta*C)
+	#pragma scop
+	{
+		#pragma species kernel C[0:NI-1,0:NI-1]|element ^ A[0:NI-1,0:NJ-1]|chunk(0:0,0:NJ-1) ^ B[0:NI-1,0:NJ-1]|chunk(0:0,0:NJ-1) -> C[0:NI-1,0:NI-1]|element
+		for (i = 0; i < NI; i++) {
+			for (j = 0; j < NI; j++) {
+				C[i][j] *= beta;
+				for (k = 0; k < NJ; k++) {
+					C[i][j] += alpha * A[i][k] * B[j][k];
+					C[i][j] += alpha * B[i][k] * A[j][k];
+				}
+			}
+		}
+		#pragma species endkernel syr2k_k1
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}