bones-compiler 1.1.0 → 1.3.1

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

@@ -0,0 +1,66 @@
+//
+// 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/syrk.c
+// Author.............Cedric Nugteren
+// Last modified on...07-May-2013
+//
+
+#include "common.h"
+
+// This is 'syrk', an algorithm for symmetric rank-k operations
+int main(void) {
+	int i,j,k;
+	
+	// Declare arrays on the stack
+	float A[NI][NJ];
+	float C[NI][NI];
+	
+	// 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++) {
+			A[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*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) -> 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] * A[j][k];
+				}
+			}
+		}
+		#pragma species endkernel syrk_k1
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}

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

@@ -0,0 +1,61 @@
+//
+// 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/trisolv.c
+// Author.............Cedric Nugteren
+// Last modified on...03-Jul-2012
+//
+
+#include "common.h"
+
+// This is 'trisolv', a solver for linear systems with triangular matrices
+int main(void) {
+	int i,j;
+	float A_i_i;
+	
+	// Declare arrays on the stack
+	float A[NX][NX];
+	float c[NX];
+	float x[NX];
+	
+	// Set the input data
+	for (i=0; i<NX; i++) {
+		c[i] = ((float) i) / NX;
+		x[i] = ((float) i) / NX;
+		for (j=0; j<NX; j++) {
+			A[i][j] = ((float) i*j) / NX;
+		}
+	}
+	
+	// Perform the computation
+	#pragma scop
+	{
+		for (i = 0; i < NX; i++) {
+			x[i] = c[i];
+			A_i_i = A[i][i];
+			#pragma species kernel x[i:i]|full ^ A[i:i,0:i-1]|element ^ x[0:i-1]|element -> x[i:i]|shared
+			for (j = 0; j <= i - 1; j++) {
+				x[i] = x[i] - A[i][j] * x[j];
+				x[i] = x[i] / A_i_i;
+			}
+			#pragma species endkernel trisolv_k4
+		}
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}

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

@@ -0,0 +1,61 @@
+//
+// 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/trmm.c
+// Author.............Cedric Nugteren
+// Last modified on...26-Jun-2012
+//
+
+#include "common.h"
+
+// This is 'trmm', a triangular matrix multiplication kernel
+int main(void) {
+	int i,j,k;
+	
+	// Declare arrays on the stack
+	float A[NI][NI];
+	float B[NI][NI];
+	
+	// Set the constants
+	int alpha = 32412;
+	
+	// Set the input data
+	for (i=0; i<NI; i++) {
+		for (j=0; j<NI; j++) {
+			A[i][j] = ((float) i*j) / NI;
+			B[i][j] = ((float) i*j) / NI;
+		}
+	}
+	
+	// Perform the computation (B := alpha*A'*B, with A triangular)
+	#pragma scop
+	{
+		for (i = 1; i < NI; i++) {
+			for (j = 0; j < NI; j++) {
+				#pragma species kernel B[i:i,j:j]|full ^ A[i:i,0:i-1]|element ^ B[j:j,0:i-1]|element -> B[i:i,j:j]|shared
+				for (k = 0; k < i; k++) {
+					B[i][j] += alpha * A[i][k] * B[j][k];
+				}
+				#pragma species endkernel trmm_k3
+			}
+		}
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/test/examples/chunk/example01_species.c

@@ -0,0 +1,58 @@
+//
+// This file is part of the Bones source-to-source compiler examples. This C-code
+// example is meant to illustrate the use of Bones. For more information on Bones
+// use the contact information below.
+//
+// == More information on Bones
+// Contact............Cedric Nugteren <c.nugteren@tue.nl>
+// Web address........http://parse.ele.tue.nl/bones/
+//
+// == File information
+// Filename...........chunk/example1.c
+// Author.............Cedric Nugteren
+// Last modified on...16-April-2012
+//
+
+#include <stdio.h>
+
+// This is 'example1', a basic chunk to element example using a 2D tile
+int main(void) {
+	int i,j;
+	int i2,j2;
+	int result = 0;
+	
+	// Declare input/output arrays
+	int A[560][32];
+	int B[56][16];
+	
+	// Set the input data
+	for(i=0;i<560;i++) {
+		for(j=0;j<32;j++) {
+			A[i][j] = i+j;
+		}
+	}
+	
+	// Perform the computation
+	#pragma scop
+	{
+		#pragma species kernel A[0:559,0:31]|chunk(0:9,0:1) -> B[0:55,0:15]|element
+		for (i = 0; i < 56; i++) {
+			for (j = 0; j < 16; j++) {
+				result = 0;
+				for (i2 = 0; i2 < 10; i2++) {
+					for (j2 = 0; j2 < 2; j2++) {
+						result = result + A[i * 10 + i2][j * 2 + j2];
+					}
+				}
+				B[i][j] = result;
+			}
+		}
+		#pragma species endkernel example01_k1
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/test/examples/chunk/example02_species.c

@@ -0,0 +1,48 @@
+//
+// This file is part of the Bones source-to-source compiler examples. This C-code
+// example is meant to illustrate the use of Bones. For more information on Bones
+// use the contact information below.
+//
+// == More information on Bones
+// Contact............Cedric Nugteren <c.nugteren@tue.nl>
+// Web address........http://parse.ele.tue.nl/bones/
+//
+// == File information
+// Filename...........chunk/example2.c
+// Author.............Cedric Nugteren
+// Last modified on...16-April-2012
+//
+
+#include <stdio.h>
+#define SIZE 2048
+#define HALFSIZE (SIZE/2)
+
+// This is 'example2', demonstrating a chunk-example without an inner-loop, everything is unrolled manually
+int main(void) {
+	int i;
+	
+	// Declare input/output arrays
+	float A[SIZE];
+	float B[HALFSIZE];
+	
+	// Set the input data
+	for(i=0;i<SIZE;i++) {
+		A[i] = i%6+i;
+	}
+	
+	// Perform the computation
+	#pragma scop
+	{
+		#pragma species kernel A[0:2*HALFSIZE-1]|chunk(0:1) -> B[0:HALFSIZE-1]|element
+		for (i = 0; i < HALFSIZE; i++) {
+			B[i] = A[i * 2] + A[i * 2 + 1];
+		}
+		#pragma species endkernel example02_k1
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/test/examples/chunk/example03_species.c

@@ -0,0 +1,63 @@
+//
+// This file is part of the Bones source-to-source compiler examples. This C-code
+// example is meant to illustrate the use of Bones. For more information on Bones
+// use the contact information below.
+//
+// == More information on Bones
+// Contact............Cedric Nugteren <c.nugteren@tue.nl>
+// Web address........http://parse.ele.tue.nl/bones/
+//
+// == File information
+// Filename...........chunk/example3.c
+// Author.............Cedric Nugteren
+// Last modified on...16-April-2012
+//
+
+#include <stdio.h>
+#define BASE 2048
+#define TILE 64
+#define SIZE (BASE*TILE)
+
+// This is 'example3', demonstrating a chunked input and a chunked output, and showing the importance of ordering (array referenced first should be placed first)
+int main(void) {
+	int i;
+	int t = 0;
+	float result = 0;
+	
+	// Declare input/output arrays
+	float A[BASE];
+	float B[SIZE];
+	float out1[SIZE];
+	float out2[SIZE];
+	
+	// Set the input data
+	for(i=0;i<BASE;i++) {
+		A[i] = 0.6;
+	}
+	for(i=0;i<SIZE;i++) {
+		B[i] = i%6+i;
+	}
+	
+	// Perform the computation
+	#pragma scop
+	{
+		#pragma species kernel A[0:BASE-1]|element ^ B[0:(BASE*TILE)-1]|chunk(0:TILE-1) -> out1[0:(BASE*TILE)-1]|chunk(0:TILE-1) ^ out2[0:(BASE*TILE)-1]|chunk(0:TILE-1)
+		for (i = 0; i < BASE; i++) {
+			result = A[i];
+			for (t = 0; t < TILE; t++) {
+				result = result + t * B[i * TILE + t];
+			}
+			for (t = 0; t < TILE; t++) {
+				out1[i * TILE + t] = result;
+				out2[i * TILE + t] = -result;
+			}
+		}
+		#pragma species endkernel example03_k1
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/test/examples/chunk/example04_species.c

@@ -0,0 +1,58 @@
+//
+// This file is part of the Bones source-to-source compiler examples. This C-code
+// example is meant to illustrate the use of Bones. For more information on Bones
+// use the contact information below.
+//
+// == More information on Bones
+// Contact............Cedric Nugteren <c.nugteren@tue.nl>
+// Web address........http://parse.ele.tue.nl/bones/
+//
+// == File information
+// Filename...........chunk/example4.c
+// Author.............Cedric Nugteren
+// Last modified on...16-April-2012
+//
+
+#include <stdio.h>
+#define SIZE 1024
+
+// This is 'example4', a basic element to chunk example with an if-statement in the body
+int main(void) {
+	int i;
+	int threshold = 19;
+	
+	// Declare input/output arrays
+	char A[SIZE];
+	char B[SIZE*2];
+	
+	// Set the input data
+	for(i=0;i<SIZE;i++) {
+		A[i] = i%100;
+	}
+	
+	// Set the output data to zero
+	for(i=0;i<SIZE*2;i++) {
+		B[i] = 0;
+	}
+	
+	// Perform the computation
+	#pragma scop
+	{
+		#pragma species kernel A[0:SIZE-1]|element -> B[0:2*SIZE-1]|chunk(0:1)
+		for (i = 0; i < SIZE; i++) {
+			B[i * 2] = A[i];
+			if (A[i] > threshold) {
+				B[i * 2 + 1] = A[i];
+			} else {
+				B[i * 2 + 1] = 0;
+			}
+		}
+		#pragma species endkernel example04_k1
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/test/examples/chunk/example05_species.c

@@ -0,0 +1,56 @@
+//
+// This file is part of the Bones source-to-source compiler examples. This C-code
+// example is meant to illustrate the use of Bones. For more information on Bones
+// use the contact information below.
+//
+// == More information on Bones
+// Contact............Cedric Nugteren <c.nugteren@tue.nl>
+// Web address........http://parse.ele.tue.nl/bones/
+//
+// == File information
+// Filename...........chunk/example5.c
+// Author.............Cedric Nugteren
+// Last modified on...16-April-2012
+//
+
+#include <stdio.h>
+
+// This is 'example5', demonstrating a chunk to element example without a temporary variable but directly writing to the output
+int main(void) {
+	int i,j;
+	int i2,j2;
+	
+	// Declare input/output arrays
+	int A[560][32];
+	int B[56][16];
+	
+	// Set the input data
+	for(i=0;i<560;i++) {
+		for(j=0;j<32;j++) {
+			A[i][j] = i+j;
+		}
+	}
+	
+	// Perform the computation
+	#pragma scop
+	{
+		#pragma species kernel A[0:559,0:31]|chunk(0:9,0:1) -> B[0:55,0:15]|element
+		for (i = 0; i < 56; i++) {
+			for (j = 0; j < 16; j++) {
+				B[i][j] = 0;
+				for (i2 = 0; i2 < 10; i2++) {
+					for (j2 = 0; j2 < 2; j2++) {
+						B[i][j] = B[i][j] + A[i * 10 + i2][j * 2 + j2];
+					}
+				}
+			}
+		}
+		#pragma species endkernel example05_k1
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+