bones-compiler 1.3.1 → 1.6.0

data/examples/chunk/example02.c

@@ -8,16 +8,16 @@
 // Web address........http://parse.ele.tue.nl/bones/
 //
 // == File information
-// Filename...........chunk/example2.c
+// Filename...........chunk/example02.c
 // Author.............Cedric Nugteren
-// Last modified on...16-April-2012
+// Last modified on...10-October-2014
 //
 
 #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
+// This is 'example02', demonstrating a chunk-example without an inner-loop, everything is unrolled manually
 int main(void) {
 	int i;
 	
@@ -31,11 +31,13 @@ int main(void) {
 	}
 	
 	// Perform the computation
-	#pragma species kernel 0:SIZE-1|chunk(0:1) -> 0:HALFSIZE-1|element
+	#pragma scop
+	#pragma species kernel A[0:SIZE-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 example2
+	#pragma endscop
 	
 	// Clean-up and exit the function
 	fflush(stdout);

data/examples/chunk/example03.c

@@ -8,9 +8,9 @@
 // Web address........http://parse.ele.tue.nl/bones/
 //
 // == File information
-// Filename...........chunk/example3.c
+// Filename...........chunk/example03.c
 // Author.............Cedric Nugteren
-// Last modified on...16-April-2012
+// Last modified on...10-October-2014
 //
 
 #include <stdio.h>
@@ -18,7 +18,7 @@
 #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)
+// This is 'example03', 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;
@@ -39,7 +39,8 @@ int main(void) {
 	}
 	
 	// Perform the computation
-	#pragma species kernel 0:BASE-1|element ^ 0:SIZE-1|chunk(0:TILE-1) -> 0:SIZE-1|chunk(0:TILE-1) ^ 0:SIZE-1|chunk(0:TILE-1)
+	#pragma scop
+	#pragma species kernel A[0:BASE-1]|element ^ B[0:SIZE-1]|chunk(0:TILE-1) -> out1[0:SIZE-1]|chunk(0:TILE-1) ^ out2[0:SIZE-1]|chunk(0:TILE-1)
 	for(i=0;i<BASE;i++) {
 		result = A[i];
 		for(t=0;t<TILE;t++) {
@@ -51,6 +52,7 @@ int main(void) {
 		}
 	}
 	#pragma species endkernel example3
+	#pragma endscop
 	
 	// Clean-up and exit the function
 	fflush(stdout);

data/examples/chunk/example04.c

@@ -8,15 +8,15 @@
 // Web address........http://parse.ele.tue.nl/bones/
 //
 // == File information
-// Filename...........chunk/example4.c
+// Filename...........chunk/example04.c
 // Author.............Cedric Nugteren
-// Last modified on...16-April-2012
+// Last modified on...10-October-2014
 //
 
 #include <stdio.h>
 #define SIZE 1024
 
-// This is 'example4', a basic element to chunk example with an if-statement in the body
+// This is 'example04', a basic element to chunk example with an if-statement in the body
 int main(void) {
 	int i;
 	int threshold = 19;
@@ -36,10 +36,12 @@ int main(void) {
 	}
 	
 	// Perform the computation
-	#pragma species kernel 0:SIZE-1|element -> 0:SIZE*2-1|chunk(0:1)
+	#pragma scop
+	#pragma species kernel A[0:SIZE-1]|element -> B[0:SIZE*2-1]|chunk(0:1)
 	for(i=0;i<SIZE;i++) {
+		float a = A[i];
 		B[i*2] = A[i];
-		if (A[i] > threshold) {
+		if (a > threshold) {
 			B[i*2+1] = A[i];
 		}
 		else {
@@ -47,6 +49,7 @@ int main(void) {
 		}
 	}
 	#pragma species endkernel example4
+	#pragma endscop
 	
 	// Clean-up and exit the function
 	fflush(stdout);

data/examples/chunk/example05.c

@@ -8,14 +8,14 @@
 // Web address........http://parse.ele.tue.nl/bones/
 //
 // == File information
-// Filename...........chunk/example5.c
+// Filename...........chunk/example05.c
 // Author.............Cedric Nugteren
-// Last modified on...16-April-2012
+// Last modified on...10-October-2014
 //
 
 #include <stdio.h>
 
-// This is 'example5', demonstrating a chunk to element example without a temporary variable but directly writing to the output
+// This is 'example05', 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;
@@ -32,7 +32,8 @@ int main(void) {
 	}
 	
 	// Perform the computation
-	#pragma species kernel 0:559,0:31|chunk(0:9,0:1) -> 0:55,0:15|element
+	#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;
@@ -44,6 +45,7 @@ int main(void) {
 		}
 	}
 	#pragma species endkernel example5
+	#pragma endscop
 	
 	// Clean-up and exit the function
 	fflush(stdout);

data/examples/chunk/example06.c

@@ -10,7 +10,7 @@
 // == File information
 // Filename...........chunk/example06.c
 // Author.............Cedric Nugteren
-// Last modified on...07-May-2013
+// Last modified on...10-October-2014
 //
 
 #include <stdio.h>
@@ -31,12 +31,14 @@ int main(void) {
 	}
 	
 	// Perform the computation
+	#pragma scop
 	#pragma species kernel A[2:N-1]|chunk(0:1) -> B[2:N-1]|chunk(0:1)
 	for (i=2; i<N-1; i=i+2) {
 		B[i] = A[i];
 		B[i+1] = A[i+1];
 	}
 	#pragma species endkernel example06
+	#pragma endscop
 	
 	// Clean-up and exit the function
 	fflush(stdout);

data/examples/chunk/example07.c

@@ -10,15 +10,16 @@
 // == File information
 // Filename...........chunk/example07.c
 // Author.............Cedric Nugteren
-// Last modified on...07-May-2013
+// Last modified on...10-October-2014
 //
 
 #include <stdio.h>
 
 // This is 'example07', a chunk/chunk with a step of 2
 int main(void) {
-	int i;
+	int i, j;
 	int N = 256;
+	int temp;
 	
 	// Declare input/output arrays
 	int A[N];
@@ -31,6 +32,7 @@ int main(void) {
 	}
 	
 	// Perform the computation
+	#pragma scop
 	#pragma species kernel A[2:N-1]|chunk(0:1) -> B[2:N-1]|chunk(0:1)
 	for (i=2; i<N-1; i=i+2) {
 		temp = 0;
@@ -41,6 +43,7 @@ int main(void) {
 		B[i+1] = temp;
 	}
 	#pragma species endkernel example07
+	#pragma endscop
 	
 	// Clean-up and exit the function
 	fflush(stdout);

data/examples/dependences/example01.c

@@ -10,7 +10,7 @@
 // == File information
 // Filename...........dependences/example01.c
 // Author.............Cedric Nugteren
-// Last modified on...07-May-2013
+// Last modified on...11-October-2014
 //
 
 #include <stdio.h>
@@ -29,11 +29,13 @@ int main(void) {
 	}
 	
 	// Perform the computation
+	#pragma scop
 	#pragma species kernel A[1:8*N-7]|element -> A[6:2*N+4]|element
 	for (i=0; i<N; i++) { // No dependence
 		A[2*i+6] = A[8*i+1];
 	}
 	#pragma species endkernel example01
+	#pragma endscop
 	
 	// Clean-up and exit the function
 	fflush(stdout);

data/examples/dependences/example02.c

@@ -10,7 +10,7 @@
 // == File information
 // Filename...........dependences/example02.c
 // Author.............Cedric Nugteren
-// Last modified on...07-May-2013
+// Last modified on...11-October-2014
 //
 
 #include <stdio.h>
@@ -29,9 +29,11 @@ int main(void) {
 	}
 	
 	// Perform the computation
+	#pragma scop
 	for (i=0; i<N; i++) { // Read-write dependence
 		A[2*i+6] = A[3*i+1];
 	}
+	#pragma endscop
 	
 	// Clean-up and exit the function
 	fflush(stdout);

data/examples/dependences/example03.c

@@ -10,7 +10,7 @@
 // == File information
 // Filename...........dependences/example03.c
 // Author.............Cedric Nugteren
-// Last modified on...07-May-2013
+// Last modified on...11-October-2014
 //
 
 #include <stdio.h>
@@ -31,10 +31,12 @@ int main(void) {
 	}
 	
 	// Perform the computation
+	#pragma scop
 	for (i=2; i<N; i++) { // Write-write dependence
 		B[i] = A[i];
 		B[i+1] = A[i+1];
 	}
+	#pragma endscop
 	
 	// Clean-up and exit the function
 	fflush(stdout);

data/examples/dependences/example04.c

@@ -10,7 +10,7 @@
 // == File information
 // Filename...........dependences/example04.c
 // Author.............Cedric Nugteren
-// Last modified on...07-May-2013
+// Last modified on...11-October-2014
 //
 
 #include <stdio.h>
@@ -31,11 +31,13 @@ int main(void) {
 	}
 	
 	// Perform the computation
+	#pragma scop
 	#pragma species kernel D[1:8*N-7,1:8*N-7]|element -> D[6:2*N+4,6:2*N+4]|element
 	for (i=0; i<N; i++) { // No dependence
 		D[2*i+6][2*i+6] = D[8*i+1][8*i+1];
 	}
 	#pragma species endkernel example04
+	#pragma endscop
 	
 	// Clean-up and exit the function
 	fflush(stdout);

data/examples/dependences/example05.c

@@ -10,7 +10,7 @@
 // == File information
 // Filename...........dependences/example05.c
 // Author.............Cedric Nugteren
-// Last modified on...07-May-2013
+// Last modified on...11-October-2014
 //
 
 #include <stdio.h>
@@ -31,9 +31,11 @@ int main(void) {
 	}
 	
 	// Perform the computation
+	#pragma scop
 	for (i=0; i<N; i++) { // Read-write dependence
 		D[2*i+6][2*i+6] = D[8*i+1][3*i+1];
 	}
+	#pragma endscop
 	
 	// Clean-up and exit the function
 	fflush(stdout);

data/examples/element/example01.c

@@ -8,14 +8,14 @@
 // Web address........http://parse.ele.tue.nl/bones/
 //
 // == File information
-// Filename...........element/example1.c
+// Filename...........element/example01.c
 // Author.............Cedric Nugteren
-// Last modified on...16-April-2012
+// Last modified on...10-October-2014
 //
 
 #include <stdio.h>
 
-// This is 'example1', a very basic element to element example using 2D arrays.
+// This is 'example01', a very basic element to element example using 2D arrays.
 int main(void) {
 	int i,j;
 	
@@ -31,13 +31,15 @@ int main(void) {
 	}
 	
 	// Perform the computation
-	#pragma species kernel 0:99,0:15|element -> 0:99,0:15|element
+	#pragma scop
+	#pragma species kernel A[0:99,0:15]|element -> B[0:99,0:15]|element
 	for(i=0;i<100;i++) {
 		for(j=0;j<16;j++) {
 			B[i][j] = 2*A[i][j];
 		}
 	}
 	#pragma species endkernel example1
+	#pragma endscop
 	
 	// Clean-up and exit the function
 	fflush(stdout);

data/examples/element/example02.c

@@ -8,14 +8,14 @@
 // Web address........http://parse.ele.tue.nl/bones/
 //
 // == File information
-// Filename...........element/example2.c
+// Filename...........element/example02.c
 // Author.............Cedric Nugteren
-// Last modified on...06-May-2013
+// Last modified on...10-October-2014
 //
 
 #include <stdio.h>
 
-// This is 'example2', demonstrating unordered element-wise computation
+// This is 'example02', demonstrating unordered element-wise computation
 int main(void) {
 	int i,j;
 	
@@ -31,13 +31,15 @@ int main(void) {
 	}
 	
 	// Perform the computation
-	#pragma species kernel 0:3,0:7|element -> 0:3,0:7|element
+	#pragma scop
+	#pragma species kernel A[0:3,0:7]|element -> B[0:3,0:7]|element
 	for(i=0;i<4;i++) {
 		for(j=0;j<8;j++) {
 			B[i][j] = A[i][7-j];
 		}
 	}
 	#pragma species endkernel example2
+	#pragma endscop
 	
 	// Clean-up and exit the function
 	fflush(stdout);

data/examples/element/example03.c

@@ -8,18 +8,18 @@
 // Web address........http://parse.ele.tue.nl/bones/
 //
 // == File information
-// Filename...........element/example3.c
+// Filename...........element/example03.c
 // Author.............Cedric Nugteren
-// Last modified on...16-April-2012
+// Last modified on...10-October-2014
 //
 
 #include <stdio.h>
-#define N1 2//8
-#define N2 4//16
-#define N3 8//32
-#define N4 16//64
+#define N1 2
+#define N2 4
+#define N3 8
+#define N4 16
 
-// This is 'example3', demonstrating a 4D array and defines for array sizes
+// This is 'example03', demonstrating a 4D array and defines for array sizes
 int main(void) {
 	int i,j,k,l;
 	
@@ -39,7 +39,8 @@ int main(void) {
 	}
 	
 	// Perform the computation
-	#pragma species kernel 0:N1-1,0:N2-1,0:N3-1,0:N4-1|element -> 0:N1-1,0:N2-1,0:N3-1,0:N4-1|element
+	#pragma scop
+	#pragma species kernel A[0:N1-1,0:N2-1,0:N3-1,0:N4-1]|element -> B[0:N1-1,0:N2-1,0:N3-1,0:N4-1]|element
 	for(i=0;i<N1;i++) {
 		for(j=0;j<N2;j++) {
 			for(k=0;k<N3;k++) {
@@ -50,6 +51,7 @@ int main(void) {
 		}
 	}
 	#pragma species endkernel example3
+	#pragma endscop
 	
 	// Clean-up and exit the function
 	fflush(stdout);

data/examples/element/example04.c

@@ -8,14 +8,14 @@
 // Web address........http://parse.ele.tue.nl/bones/
 //
 // == File information
-// Filename...........element/example4.c
+// Filename...........element/example04.c
 // Author.............Cedric Nugteren
-// Last modified on...16-April-2012
+// Last modified on...10-October-2014
 //
 
 #include <stdio.h>
 
-// This is 'example4', demonstrating two input arrays and an inner-loop as the computational body
+// This is 'example04', demonstrating two input arrays and an inner-loop as the computational body
 int main(void) {
 	int i,l;
 	float factor = 0;
@@ -32,7 +32,8 @@ int main(void) {
 	}
 	
 	// Perform the computation
-	#pragma species kernel 0:699|element ^ 0:699|element -> 0:699|element
+	#pragma scop
+	#pragma species kernel A[0:699]|element ^ B[0:699]|element -> C[0:699]|element
 	for(i=0;i<700;i++) {
 		factor = 0.5;
 		for (l=0;l<3;l++) {
@@ -41,6 +42,7 @@ int main(void) {
 		C[i] = factor*A[i] + factor*B[i];
 	}
 	#pragma species endkernel example4
+	#pragma endscop
 	
 	// Clean-up and exit the function
 	fflush(stdout);