bones-compiler 1.1.0

data/examples/benchmarks/2mm.c

@@ -0,0 +1,70 @@
+//
+// 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/2mm.c
+// Author.............Cedric Nugteren
+// Last modified on...03-April-2012
+//
+
+#include "common.h"
+
+// This is '2mm', a 2 matrix multiply kernel
+int main(void) {
+	int i,j,k;
+	
+	// Declare arrays on the stack
+	float A[NI][NK];
+	float B[NK][NJ];
+	float C[NJ][NL];
+	float D[NI][NL];
+	float tmp[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+1)) / NJ; } }
+	for (i=0; i<NL; i++) { for (j=0; j<NJ; j++) { C[i][j] = ((float) i*(j+3)) / NL; } }
+	for (i=0; i<NI; i++) { for (j=0; j<NL; j++) { D[i][j] = ((float) i*(j+2)) / NK; } }
+	
+	// Perform the computation (E := alpha*A*B*C + beta*D)
+	#pragma species kernel 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++) {
+			tmp[i][j] = 0;
+			for (k=0; k<NK; k++) {
+				tmp[i][j] += alpha * A[i][k] * B[k][j];
+			}
+		}
+	}
+	#pragma species endkernel 2mm-part1
+	#pragma species kernel 0:NI-1,0:NL-1|element ^ 0:NI-1,0:NJ-1|chunk(0:0,0:NJ-1) ^ 0:NJ-1,0:NL-1|chunk(0:NJ-1,0:0) -> 0:NI-1,0:NL-1|element
+	for (i=0; i<NI; i++) {
+		for (j=0; j<NL; j++) {
+			D[i][j] *= beta;
+			for (k=0; k<NJ; k++) {
+				D[i][j] += tmp[i][k] * C[k][j];
+			}
+		}
+	}
+	#pragma species endkernel 2mm-part2
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/examples/benchmarks/3mm.c

@@ -0,0 +1,81 @@
+//
+// 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/3mm.c
+// Author.............Cedric Nugteren
+// Last modified on...03-April-2012
+//
+
+#include "common.h"
+
+// This is '3mm', a 3 matrix multiply kernel
+int main(void) {
+	int i,j,k;
+	
+	// Declare arrays on the stack
+	float A[NI][NK];
+	float B[NK][NJ];
+	float C[NJ][NM];
+	float D[NM][NL];
+	float E[NI][NJ];
+	float F[NJ][NL];
+	float G[NI][NL];
+	
+	// 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+1)) / NJ; } }
+	for (i=0; i<NL; i++) { for (j=0; j<NJ; j++) { C[i][j] = ((float) i*(j+3)) / NL; } }
+	for (i=0; i<NI; i++) { for (j=0; j<NL; j++) { D[i][j] = ((float) i*(j+2)) / NK; } }
+	
+	// Perform the computation (G := E*F, with E := A*B and F := C*D)
+	#pragma species kernel 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
+	// E := A*B
+	for (i=0; i<NI; i++) {
+		for (j=0; j<NJ; j++) {
+			E[i][j] = 0;
+			for (k=0; k<NK; k++) {
+				E[i][j] += A[i][k] * B[k][j];
+			}
+		}
+	}
+	#pragma species endkernel 3mm-part1
+	#pragma species kernel 0:NJ-1,0:NM-1|chunk(0:0,0:NM-1) ^ 0:NM-1,0:NL-1|chunk(0:NM-1,0:0) -> 0:NJ-1,0:NL-1|element
+	// F := C*D
+	for (i=0; i<NJ; i++) {
+		for (j=0; j<NL; j++) {
+			F[i][j] = 0;
+			for (k=0; k<NM; k++) {
+				F[i][j] += C[i][k] * D[k][j];
+			}
+		}
+	}
+	#pragma species endkernel 3mm-part2
+	#pragma species kernel 0:NI-1,0:NJ-1|chunk(0:0,0:NJ-1) ^ 0:NJ-1,0:NL-1|chunk(0:NJ-1,0:0) -> 0:NI-1,0:NL-1|element
+	// G := E*F
+	for (i=0; i<NI; i++) {
+		for (j=0; j<NL; j++) {
+			G[i][j] = 0;
+			for (k=0; k<NJ; k++) {
+				G[i][j] += E[i][k] * F[k][j];
+			}
+		}
+	}
+	#pragma species endkernel 3mm-part3
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/examples/benchmarks/adi.c

@@ -0,0 +1,81 @@
+//
+// 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/adi.c
+// Author.............Cedric Nugteren
+// Last modified on...29-May-2012
+//
+
+#include "common.h"
+
+// This is 'adi', an alternating direction implicit solver
+int main(void) {
+	int t,i,j,i1,i2;
+	
+	// Declare arrays on the stack
+	float X[N][N];
+	float A[N][N];
+	float B[N][N];
+	
+	// Set the input data
+	for (i=0; i<N; i++) {
+		for (j=0; j<N; j++) {
+			X[i][j] = ((float) i*(j+1) + 1) / N;
+			A[i][j] = ((float) i*(j+2) + 2) / N;
+			B[i][j] = ((float) i*(j+3) + 3) / N;
+		}
+	}
+	
+	// Perform the computation
+	for (t=0; t<TSTEPS; t++) {
+		for (i1=0; i1<N; i1++) {
+			for (i2=1; i2<N; i2++) {
+				X[i1][i2] = X[i1][i2] - X[i1][i2-1] * A[i1][i2] / B[i1][i2-1];
+				B[i1][i2] = B[i1][i2] - A[i1][i2] * A[i1][i2] / B[i1][i2-1];
+			}
+		}
+		#pragma species kernel 0:N-1,N-1:N-1|element  ^ 0:N-1,N-1:N-1|element -> 0:N-1,N-1:N-1|element
+		for (i1=0; i1<N; i1++) {
+			X[i1][N-1] = X[i1][N-1] / B[i1][N-1];
+		}
+		#pragma species endkernel adi-part1
+		for (i1=0; i1<N; i1++) {
+			for (i2=0; i2<N-2; i2++) {
+				X[i1][N-i2-2] = (X[i1][N-2-i2] - X[i1][N-2-i2-1] * A[i1][N-i2-3]) / B[i1][N-3-i2];
+			}
+		}
+		for (i1=1; i1<N; i1++) {
+			for (i2=0; i2<N; i2++) {
+				X[i1][i2] = X[i1][i2] - X[i1-1][i2] * A[i1][i2] / B[i1-1][i2];
+				B[i1][i2] = B[i1][i2] - A[i1][i2] * A[i1][i2] / B[i1-1][i2];
+			}
+		}
+		#pragma species kernel N-1:N-1,0:N-1|element  ^ N-1:N-1,0:N-1|element -> N-1:N-1,0:N-1|element
+		for (i2=0; i2<N; i2++) {
+			X[N-1][i2] = X[N-1][i2] / B[N-1][i2];
+		}
+		#pragma species endkernel adi-part2
+		for (i1=0; i1<N-2; i1++) {
+			for (i2=0; i2<N; i2++) {
+				X[N-2-i1][i2] = (X[N-2-i1][i2] - X[N-i1-3][i2] * A[N-3-i1][i2]) / B[N-2-i1][i2];
+			}
+		}
+	}
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/examples/benchmarks/atax.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/atax.c
+// Author.............Cedric Nugteren
+// Last modified on...03-April-2012
+//
+
+#include "common.h"
+
+// This is 'atax', a matrix transpose and vector multiplication kernel
+int main(void) {
+	int i,j;
+	
+	// Declare arrays on the stack
+	float A[NX][NY];
+	float x[NY];
+	float y[NX];
+	float tmp[NX];
+	
+	// Set the input data
+	for (i=0; i<NY; i++) {
+		x[i] = i*3.14159;
+	}
+	for (i=0; i<NX; i++) {
+		for (j=0; j<NY; j++) {
+			A[i][j] = ((float) i*(j+1)) / NX;
+		}
+	}
+	
+	// Perform the computation (y := A'Ax)
+	#pragma species kernel 0:NX-1,0:NY-1|chunk(0:0,0:NY-1) ^ 0:NY-1|full -> 0:NX-1|element
+	for (i=0; i<NX; i++) {
+		tmp[i] = 0;
+		for (j=0; j<NY; j++) {
+			tmp[i] = tmp[i] + A[i][j] * x[j];
+		}
+	}
+	#pragma species endkernel atax-part1
+	#pragma species kernel 0:NX-1,0:NY-1|chunk(0:NX-1,0:0) ^ 0:NX-1|full -> 0:NY-1|element
+	for (j=0; j<NY; j++) {
+		y[j] = 0;
+		for (i=0; i<NX; i++) {
+			y[j] = y[j] + A[i][j] * tmp[i];
+		}
+	}
+	#pragma species endkernel atax-part2
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/examples/benchmarks/bicg.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/bicg.c
+// Author.............Cedric Nugteren
+// Last modified on...03-April-2012
+//
+
+#include "common.h"
+
+// This is 'bicg', a biconjugate gradients method kernel
+int main(void) {
+	int i,j;
+	
+	// Declare arrays on the stack
+	float A[NX][NY];
+	float p[NY];
+	float q[NX];
+	float r[NX];
+	float s[NY];
+	
+	// Set the input data
+	for (i=0; i<NY; i++) {
+		p[i] = i*3.14159;
+	}
+	for (i=0; i<NX; i++) {
+		r[i] = i*3.14159;
+		for (j=0; j<NY; j++) {
+			A[i][j] = ((float) i*(j+1)) / NX;
+		}
+	}
+	
+	// Perform the computation
+	#pragma species kernel 0:NX-1|full ^ 0:NX-1,0:NY-1|chunk(0:NX-1,0:0) -> 0:NY-1|element
+	for (j=0; j<NY; j++) {
+		s[j] = 0;
+		for (i=0; i<NX; i++) {
+			s[j] = s[j] + r[i] * A[i][j];
+		}
+	}
+	#pragma species endkernel bicg-part1
+	#pragma species kernel 0:NX-1,0:NY-1|chunk(0:0,0:NY-1) ^ 0:NY-1|full -> 0:NX-1|element
+	for (i=0; i<NX; i++) {
+		q[i] = 0;
+		for (j=0; j<NY; j++) {
+			q[i] = q[i] + A[i][j] * p[j];
+		}
+	}
+	#pragma species endkernel bicg-part2
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/examples/benchmarks/cholesky.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/cholesky.c
+// Author.............Cedric Nugteren
+// Last modified on...03-Jul-2012
+//
+
+#include "common.h"
+
+// This is 'cholesky', a cholesky decomposition kernel
+int main(void) {
+	int i,j,k;
+	float x[1];
+	float p_i;
+	
+	// Declare arrays on the stack
+	float A[N][N];
+	float p[N];
+	
+	// Set the input data
+	for (i=0; i<N; i++) {
+		for (j=0; j<N; j++) {
+			A[i][j] = i*2.3 + 1;
+		}
+	}
+	
+	// Perform the computation
+	for (i=0; i<N; i++) {
+		x[0] = A[i][i];
+		#pragma species kernel i:i,0:i-1|element -> 0:0|shared
+		for (j=0; j<=i-1; j++) {
+			x[0] = x[0] - A[i][j] * A[i][j];
+		}
+		#pragma species endkernel cholesky-part1
+		p[i] = 1.0 / sqrt(x[0]);
+		p_i = p[i];
+		#pragma species kernel i:i,i+1:N-1|element ^ i+1:N-1,0:i-1|chunk(0:0,0:i-1) ^ i:i,0:i-1|full -> 0:0|shared ^ i+1:N-1,i:i|element
+		for (j=i+1; j<N; j++) {
+			x[0] = A[i][j];
+			for (k=0; k<=i-1; k++) {
+				x[0] = x[0] - A[j][k] * A[i][k];
+			}
+			A[j][i] = x[0] * p_i;
+		}
+		#pragma species endkernel cholesky-part2
+	}
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}

data/examples/benchmarks/common.h

@@ -0,0 +1,168 @@
+//
+// This file is part of the Bones source-to-source compiler examples. This header
+// contains array size definitions and is common among the examples that are also
+// 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/polybench.h
+// Author.............Cedric Nugteren
+// Last modified on...23-May-2012
+//
+
+// Include C-libraries
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+
+// Select a dataset size
+//#define MINI_DATASET
+#define SMALL_DATASET
+//#define STANDARD_DATASET
+//#define LARGE_DATASET
+//#define EXTRALARGE_DATASET
+
+// Defines used per benchmark:
+//
+// N        [adi, cholesky, correlation, covariance, floyd-warshall, jacobi-2d-imper, lu, ludcmp, seidel-2d]
+// M        [correlation, covariance]
+// NI       [2mm, 3mm, fdtd-2d, gemm, symm, syrk, syr2k, trmm]
+// NJ       [2mm, 3mm, fdtd-2d, gemm, symm, syrk, syr2k]
+// NK       [2mm, 3mm, gemm]
+// NL       [2mm, 3mm]
+// NQ       [doitgen]
+// NR       [doitgen]
+// NP       [doitgen]
+// NM       [3mm]
+// NX       [atax, bicg, durbin, gemver, gesummv, mvt, trisolv]
+// NY       [atax, bicg]
+// CZ       [fdtd-2d-apml]
+// CYM      [fdtd-2d-apml]
+// CXM      [fdtd-2d-apml]
+// LARGE_N  [jacobi-1d-imper]
+// LENGTH   [dynprog, reg_detect]
+// TSTEPS   [adi, fdtd-2d, jacobi-1d-imper, jacobi-2d-imper, seidel-2d]
+// ITER     [dynprog, reg_detect]
+// MAXGRID  [reg_detect]
+//
+
+// Determine the sizes of the 5 possible datasets
+#ifdef MINI_DATASET
+	#define N 32
+	#define M 32
+	#define NI 32
+	#define NJ 32
+	#define NK 32
+	#define NL 32
+	#define NM 32
+	#define NQ 10
+	#define NR 10
+	#define NP 10
+	#define NX 32
+	#define NY 32
+	#define CZ 32
+	#define CYM 32
+	#define CXM 32
+	#define LARGE_N 500
+	#define LENGTH 32
+	#define TSTEPS 2
+	#define ITER 10
+	#define MAXGRID 2
+#endif
+#ifdef SMALL_DATASET
+	#define N 256
+	#define M 256
+	#define NI 128
+	#define NJ 128
+	#define NK 128
+	#define NL 128
+	#define NM 128
+	#define NQ 32
+	#define NR 32
+	#define NP 32
+	#define NX 500
+	#define NY 500
+	#define CZ 64
+	#define CYM 64
+	#define CXM 64
+	#define LARGE_N 1000
+	#define LENGTH 50
+	#define TSTEPS 2
+	#define ITER 2
+	#define MAXGRID 8
+#endif
+#ifdef STANDARD_DATASET
+	#define N 1024
+	#define M 1024
+	#define NI 1024
+	#define NJ 1024
+	#define NK 1024
+	#define NL 1024
+	#define NM 1024
+	#define NQ 128
+	#define NR 128
+	#define NP 128
+	#define NX 4000
+	#define NY 4000
+	#define CZ 256
+	#define CYM 256
+	#define CXM 256
+	#define LARGE_N 10000
+	#define LENGTH 50
+	#define TSTEPS 2
+	#define ITER 10
+	#define MAXGRID 32
+#endif
+#ifdef LARGE_DATASET
+	#define N 2048
+	#define M 2048
+	#define NI 2048
+	#define NJ 2048
+	#define NK 2048
+	#define NL 2048
+	#define NM 2048
+	#define NQ 256
+	#define NR 256
+	#define NP 256
+	#define NX 4096
+	#define NY 4096
+	#define CZ 512
+	#define CYM 512
+	#define CXM 512
+	#define LARGE_N 2048*2048
+	#define LENGTH 500
+	#define TSTEPS 5
+	#define ITER 100
+	#define MAXGRID 128
+#endif
+#ifdef EXTRALARGE_DATASET
+	#define N 4000
+	#define M 4000
+	#define NI 4000
+	#define NJ 4000
+	#define NK 4000
+	#define NL 4000
+	#define NM 4000
+	#define NQ 1000
+	#define NR 1000
+	#define NP 1000
+	#define NX 100000
+	#define NY 100000
+	#define CZ 1000
+	#define CYM 1000
+	#define CXM 1000
+	#define LARGE_N 10000000
+	#define LENGTH 500
+	#define TSTEPS 10
+	#define ITER 1000
+	#define MAXGRID 512
+#endif
+