bones-compiler 1.1.0 → 1.3.1

data/examples/element/{example2.c → example02.c}

@@ -10,7 +10,7 @@
 // == File information
 // Filename...........element/example2.c
 // Author.............Cedric Nugteren
-// Last modified on...16-April-2012
+// Last modified on...06-May-2013
 //
 
 #include <stdio.h>
@@ -31,7 +31,7 @@ int main(void) {
 	}
 	
 	// Perform the computation
-	#pragma species kernel unordered 0:3,0:7|element -> 0:3,0:7|element
+	#pragma species kernel 0:3,0:7|element -> 0:3,0:7|element
 	for(i=0;i<4;i++) {
 		for(j=0;j<8;j++) {
 			B[i][j] = A[i][7-j];

data/examples/element/example13.c

@@ -0,0 +1,73 @@
+//
+// 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...........element/example13.c
+// Author.............Cedric Nugteren
+// Last modified on...07-May-2013
+//
+
+#include <stdio.h>
+
+// This is 'example13', an example with multiple loop nests and various if-statements
+int main(void) {
+	int i,j;
+	int N = 256;
+	
+	// Declare input/output arrays
+	int A[N];
+	int B[N];
+	int C[N];
+	int D[N][N];
+	int E[N][N];
+	
+	// Set the input data
+	for(i=0;i<N;i++) {
+		A[i] = i;
+		B[i] = i+5;
+		C[i] = i+9;
+		for(j=0;j<N;j++) {
+			D[i][j] = i*j+3;
+			E[i][j] = i*j+9;
+		}
+	}
+	
+	// Perform the computation
+	#pragma species kernel C[0:N-1]|element -> B[11:N-1]|element ^ A[0:5]|element
+	for (i=0; i<N; i++) {
+		if (i > 10) {
+			B[i] = C[i];
+		}
+		if (i < 6) {
+			A[i] = C[i];
+		}
+	}
+	#pragma species endkernel example13_k1
+	#pragma species kernel A[50:N-1]|element -> B[50:N-1]|element
+	for (i=0; i<N-9; i++) {
+		if (i+10 > 50) {
+			B[i+9] = A[i+9];
+		}
+	}
+	#pragma species endkernel example13_k2
+	#pragma species kernel E[5:N-1,0:N-1]|element -> D[5:N-1,0:N-1]|element
+	for (i=0; i<N; i++) {
+		for (j=0; j<N; j++) {
+			if (i > 4) {
+				D[i][j] = E[i][j];
+			}
+		}
+	}
+	#pragma species endkernel example13_k3
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/examples/fusion/example01.c

@@ -0,0 +1,68 @@
+//
+// 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...........fusion/example01.c
+// Author.............Cedric Nugteren
+// Last modified on...09-July-2013
+//
+
+#include <stdio.h>
+#define N 512
+#define M 2048
+
+// This is 'example01', a basic example of an opportunity for scalar kernel fusion.
+int main(void) {
+	int i,j;
+	
+	// Declare input/output arrays
+	int A[N][M];
+	int B[N][M];
+	int C[N][M];
+	
+	// Set the input data
+	for(i=0;i<N;i++) {
+		for(j=0;j<M;j++) {
+			A[i][j] = i+j;
+		}
+	}
+	
+	// Perform the computation
+	#pragma species kernel A[0:N-1,0:M-1]|element -> B[0:N-1,0:M-1]|element
+	for(i=0;i<N;i++) {
+		for(j=0;j<M;j++) {
+			B[i][j] = 2*A[i][j];
+		}
+	}
+	#pragma species endkernel example01-part1
+	#pragma species kernel B[0:N-1,0:M-1]|element -> C[0:N-1,0:M-1]|element
+	for(i=0;i<N;i++) {
+		for(j=0;j<M;j++) {
+			C[i][j] = 8*B[i][j];
+		}
+	}
+	#pragma species endkernel example01-part2
+	
+	/*
+	#pragma species kernel A[0:N-1,0:M-1]|element -> B[0:N-1,0:M-1]|element ^ C[0:N-1,0:M-1]|element
+	for(i=0;i<N;i++) {
+		for(j=0;j<M;j++) {
+			B[i][j] = 2*A[i][j];
+			C[i][j] = 8*B[i][j];
+		}
+	}
+	#pragma species endkernel example01-fused
+	*/
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	C[8][9] = C[8][9];
+	return 0;
+}
+

data/examples/fusion/example02.c

@@ -0,0 +1,73 @@
+//
+// 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...........fusion/example02.c
+// Author.............Cedric Nugteren
+// Last modified on...09-July-2013
+//
+
+#include <stdio.h>
+#define N 2048
+#define M 512
+// Condition: M must be smaller than N
+
+// This is 'example02', an example of scalar kernel fusion with mismatching bounds but independent loop bodies.
+int main(void) {
+	int i,j;
+	
+	// Declare input/output arrays
+	int A[N][M];
+	int B[N][M];
+	int C[N][M];
+	
+	// Set the input data
+	for(i=0;i<N;i++) {
+		for(j=0;j<M;j++) {
+			A[i][j] = i+j;
+		}
+	}
+	
+	// Perform the computation
+	#pragma species kernel A[0:N-1,10:M-1]|element -> B[0:N-1,10:M-1]|element
+	for(i=0;i<N;i++) {
+		for(j=10;j<M;j++) {
+			B[i][j] = A[i][j] + 3;
+		}
+	}
+	#pragma species endkernel example02-part1
+	#pragma species kernel A[0:M-1,0:M-1]|element -> C[0:M-1,0:M-1]|element
+	for(i=0;i<M;i++) {
+		for(j=0;j<M;j++) {
+			C[i][j] = -9*A[i][j];
+		}
+	}
+	#pragma species endkernel example02-part2
+	
+	/*
+	#pragma species kernel A[0:N-1,0:M-1]|element -> B[0:N-1,0:M-1]|element ^ C[0:N-1,0:M-1]|element
+	for(i=0;i<MAX(N,M);i++) {
+		for(j=0;j<M;j++) {
+			if (j >= 10 && i < N) {
+				B[i][j] = A[i][j] + 3;
+			}
+			if (i < M) {
+				C[i][j] = -9*A[i][j];
+			}
+		}
+	}
+	#pragma species endkernel example02-fused
+	*/
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	C[8][9] = C[8][9];
+	return 0;
+}
+

data/examples/fusion/example03.c

@@ -0,0 +1,72 @@
+//
+// 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...........fusion/example03.c
+// Author.............Cedric Nugteren
+// Last modified on...02-Oct-2013
+//
+
+#include <stdio.h>
+
+// This is 'example03', with code similar to PolyBench's "2mm" benchmark. This is an example where fusion is only legal w.r.t. the i-loop
+int main(void) {
+	int i,j,k;
+	
+	// Declare arrays on the stack
+	float A[2048][2048];
+	float B[2048][2048];
+	float C[2048][2048];
+	float D[2048][2048];
+	float tmp[2048][2048];
+	
+	// Set the constants
+	int alpha = 32412;
+	int beta = 2123;
+	
+	// Set the input data
+	for (i=0; i<2048; i++) { for (j=0; j<2048; j++) { A[i][j] = ((float) i*j) / 2048; } }
+	for (i=0; i<2048; i++) { for (j=0; j<2048; j++) { B[i][j] = ((float) i*(j+1)) / 2048; } }
+	for (i=0; i<2048; i++) { for (j=0; j<2048; j++) { C[i][j] = ((float) i*(j+3)) / 2048; } }
+	for (i=0; i<2048; i++) { for (j=0; j<2048; j++) { D[i][j] = ((float) i*(j+2)) / 2048; } }
+	
+	// Perform the computation (E := alpha*A*B*C + beta*D)
+	#pragma species copyin A[0:2047,0:2047]|0 ^ B[0:2047,0:2047]|0 ^ D[0:2047,0:2047]|1 ^ C[0:2047,0:2047]|1
+	#pragma species sync 0
+	#pragma species kernel A[0:2047,0:2047]|chunk(0:0,0:2047) ^ B[0:2047,0:2047]|chunk(0:2047,0:0) -> tmp[0:2047,0:2047]|element
+	for (i=0; i<2048; i++) {
+		for (j=0; j<2048; j++) {
+			tmp[i][j] = 0;
+			for (k=0; k<2048; k++) {
+				tmp[i][j] += alpha * A[i][k] * B[k][j];
+			}
+		}
+	}
+	#pragma species endkernel example03-part1
+	#pragma species copyout tmp[0:2047,0:2047]|2
+	#pragma species sync 1
+	#pragma species kernel D[0:2047,0:2047]|element ^ tmp[0:2047,0:2047]|chunk(0:0,0:2047) ^ C[0:2047,0:2047]|chunk(0:2047,0:0) -> D[0:2047,0:2047]|element
+	for (i=0; i<2048; i++) {
+		for (j=0; j<2048; j++) {
+			D[i][j] *= beta;
+			for (k=0; k<2048; k++) {
+				D[i][j] += tmp[i][k] * C[k][j];
+			}
+		}
+	}
+	#pragma species endkernel example03-part2
+	#pragma species copyout D[0:2047,0:2047]|2
+	#pragma species sync 2
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	D[8][9] = D[8][9];
+	return 0;
+}
+

data/examples/fusion/example04.c

@@ -0,0 +1,61 @@
+//
+// 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...........fusion/example04.c
+// Author.............Cedric Nugteren
+// Last modified on...02-Oct-2013
+//
+
+#include <stdio.h>
+
+// This is 'example04', with code similar to PolyBench's "atax" benchmark
+int main(void) {
+	int i,j;
+	
+	// Declare arrays on the stack
+	float A[4096][4096];
+	float x[4096];
+	float y[4096];
+	float tmp[4096];
+	
+	// Set the input data
+	for (i=0; i<4096; i++) {
+		x[i] = i*3.14159;
+	}
+	for (i=0; i<4096; i++) {
+		for (j=0; j<4096; j++) {
+			A[i][j] = ((float) i*(j+1)) / 4096;
+		}
+	}
+	
+	// Perform the computation (y := A'Ax)
+	#pragma species kernel 0:4095,0:4095|chunk(0:0,0:4095) ^ 0:4095|full -> 0:4095|element
+	for (i=0; i<4096; i++) {
+		tmp[i] = 0;
+		for (j=0; j<4096; j++) {
+			tmp[i] = tmp[i] + A[i][j] * x[j];
+		}
+	}
+	#pragma species endkernel atax-part1
+	#pragma species kernel 0:4095,0:4095|chunk(0:4095,0:0) ^ 0:4095|full -> 0:4095|element
+	for (j=0; j<4096; j++) {
+		y[j] = 0;
+		for (i=0; i<4096; i++) {
+			y[j] = y[j] + A[i][j] * tmp[i];
+		}
+	}
+	#pragma species endkernel atax-part2
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	y[9] = y[9];
+	return 0;
+}
+

data/examples/fusion/example05.c

@@ -0,0 +1,55 @@
+//
+// 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...........fusion/example05.c
+// Author.............Cedric Nugteren
+// Last modified on...08-October-2013
+//
+
+#include <stdio.h>
+
+// This is 'example05', like example02 but with constant values.
+int main(void) {
+	int i,j;
+	
+	// Declare input/output arrays
+	int A[2048][1024];
+	int B[2048][1024];
+	int C[2048][1024];
+	
+	// Set the input data
+	for(i=0;i<2048;i++) {
+		for(j=0;j<1024;j++) {
+			A[i][j] = i+j;
+		}
+	}
+	
+	// Perform the computation
+	#pragma species kernel A[0:2047,0:1023]|element -> B[0:2047,0:1023]|element
+	for(i=0;i<2048;i++) {
+		for(j=0;j<1024;j++) {
+			B[i][j] = A[i][j] + 3;
+		}
+	}
+	#pragma species endkernel example05-part1
+	#pragma species kernel A[0:2047,0:979]|element -> C[0:2047,0:979]|element
+	for(i=0;i<2048;i++) {
+		for(j=0;j<980;j++) {
+			C[i][j] = 9*A[i][j];
+		}
+	}
+	#pragma species endkernel example05-part2
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	C[8][9] = C[8][9];
+	return 0;
+}
+