bones-compiler 1.1.0 → 1.3.1

data/test/examples/element/example11_species.c

@@ -0,0 +1,51 @@
+//
+// 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/example11.c
+// Author.............Cedric Nugteren
+// Last modified on...16-April-2012
+//
+
+#include <stdio.h>
+
+// This is 'example11', demonstrating an inner-loop which is dependent on an outer-loop variable and a classification of the inner-loop only
+int main(void) {
+	int i,j;
+	
+	// Declare input/output arrays
+	int A[128][128];
+	int B[128][128];
+	
+	// Set the input data
+	for(i=0;i<128;i++) {
+		for(j=0;j<128;j++) {
+			A[i][j] = i+j;
+			B[i][j] = 999;
+		}
+	}
+	
+	// Perform the computation
+	#pragma scop
+	{
+		#pragma species kernel A[0:127,0:127]|element -> B[0:127,0:127]|element
+		for (i = 0; i < 128; i++) {
+			for (j = i; j < 128; j++) {
+				B[i][j] = 2 * A[i][j];
+			}
+		}
+		#pragma species endkernel example11_k1
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/test/examples/element/example12_species.c

@@ -0,0 +1,60 @@
+//
+// 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/example12.c
+// Author.............Cedric Nugteren
+// Last modified on...06-Aug-2012
+//
+
+#include <stdio.h>
+#include <stdlib.h>
+
+void computation(int* A, int* B, int constant);
+
+// This is 'example12', demonstrating a classification in another function
+int main(void) {
+	int i;
+	
+	// Declare input/output arrays
+	int* A = (int*)malloc(128*sizeof(int));
+	int* B = (int*)malloc(128*sizeof(int));
+	
+	// Set the input data
+	for(i=0;i<128;i++) {
+		A[i] = i+3;
+		B[i] = 999;
+	}
+	int constant = 3;
+	
+	// Call the computation function
+	computation(A,B,constant);
+	
+	// Clean-up and exit the function
+	free(A);
+	free(B);
+	fflush(stdout);
+	return 0;
+}
+
+// Function implementing the computation for 'example12'
+void computation(int* A, int* B, int constant) {
+	int i;
+	
+	// Perform the computation
+	#pragma scop
+	{
+		#pragma species kernel A[0:127]|element -> B[0:127]|element
+		for (i = 0; i < 128; i++) {
+			B[i] = 2 * A[i] + constant;
+		}
+		#pragma species endkernel example12_k1
+	}
+	#pragma endscop
+}

data/test/examples/element/example13_species.c

@@ -0,0 +1,77 @@
+//
+// 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 scop
+	{
+		#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
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/test/examples/neighbourhood/example01_species.c

@@ -0,0 +1,57 @@
+//
+// 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...........neighbourhood/example1.c
+// Author.............Cedric Nugteren
+// Last modified on...16-April-2012
+//
+
+#include <stdio.h>
+#define SIZE 60000
+#define NB 2
+
+// This is 'example1', demonstrating a basic 1D neighbourhood-based computation whose size is set by a define
+int main(void) {
+	int i,n;
+	float result = 0;
+	
+	// Declare input/output arrays
+	float A[SIZE];
+	float B[SIZE];
+	
+	// Set the input data
+	for(i=0;i<SIZE;i++) {
+		A[i] = i/2.0;
+	}
+	
+	// Perform the computation
+	#pragma scop
+	{
+		#pragma species kernel A[0:SIZE-1]|neighbourhood(-NB:NB) ^ A[0:SIZE-1]|element -> B[0:SIZE-1]|element
+		for (i = 0; i < SIZE; i++) {
+			if (i >= NB && i < SIZE - NB) {
+				result = 0;
+				for (n = -NB; n <= NB; n++) {
+					result = result + A[i + n];
+				}
+				B[i] = result / (NB * 2 + 1);
+			} else {
+				B[i] = A[i];
+			}
+		}
+		#pragma species endkernel example01_k1
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/test/examples/neighbourhood/example02_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...........neighbourhood/example2.c
+// Author.............Cedric Nugteren
+// Last modified on...16-April-2012
+//
+
+#include <stdio.h>
+#define A 256
+#define B 512
+
+// This is 'example2', demonstrating a 2D array, a 2D neighbourhood and a for-loop-less notation of the neighbourhood accesses
+int main(void) {
+	int i,j;
+	
+	// Declare input/output arrays
+	float in[A][B];
+	float out[A][B];
+	
+	// Set the input data
+	for(i=0;i<A;i++) {
+		for(j=0;j<B;j++) {
+			in[i][j] = i+j;
+		}
+	}
+	
+	// Perform the computation
+	#pragma scop
+	{
+		#pragma species kernel in[0:A-1,0:B-1]|neighbourhood(-1:1,-1:1) -> out[0:A-1,0:B-1]|element
+		for (i = 0; i < A; i++) {
+			for (j = 0; j < B; j++) {
+				if (i >= 1 && j >= 1 && i < A - 1 && j < B - 1) {
+					out[i][j] = (in[i + 1][j + 1] + in[i + 1][j] + in[i + 1][j - 1] + in[i][j + 1] + in[i][j] + in[i][j - 1] + in[i - 1][j + 1] + in[i - 1][j] + in[i - 1][j - 1]) / 9.0;
+				} else {
+					out[i][j] = in[i][j];
+				}
+			}
+		}
+		#pragma species endkernel example02_k1
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+

data/test/examples/neighbourhood/example03_species.c

@@ -0,0 +1,83 @@
+//
+// 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...........neighbourhood/example3.c
+// Author.............Cedric Nugteren
+// Last modified on...16-April-2012
+//
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+#define A 1024
+#define B 1536
+
+// Forward declarations of helper functions for statically allocated 2D memory
+float ** alloc_2D(int size1, int size2);
+void free_2D(float ** array_2D);
+
+// This is 'example3', demonstrating a neighbourhood with only some values used (a cross) and a math.h square root function call
+int main(void) {
+	int i,j;
+	int sizea = A;
+	int sizeb = B;
+	
+	// Declare input/output arrays
+	float **in = alloc_2D(sizea,sizeb);
+	float **out = alloc_2D(sizea,sizeb);
+	
+	// Set the input data
+	for(i=0;i<sizea;i++) {
+		for(j=0;j<sizeb;j++) {
+			in[i][j] = i+j;
+		}
+	}
+	
+	// Perform the computation
+	#pragma scop
+	{
+		#pragma species kernel in[0:sizea-1,0:sizeb-1]|neighbourhood(-1:1,-1:1) -> out[0:sizea-1,0:sizeb-1]|element
+		for (i = 0; i < sizea; i++) {
+			for (j = 0; j < sizeb; j++) {
+				if (i >= 1 && j >= 1 && i < sizea - 1 && j < sizeb - 1) {
+					out[i][j] = in[i + 1][j] + in[i][j + 1] + in[i][j] + in[i][j - 1] + in[i - 1][j];
+				} else {
+					out[i][j] = sqrt(in[i][j]);
+				}
+			}
+		}
+		#pragma species endkernel example03_k1
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	free_2D(in);
+	free_2D(out);
+	fflush(stdout);
+	return 0;
+}
+
+// Helper function to allocate a 2D-array
+float ** alloc_2D(int size1, int size2) {
+	int a;
+	float ** array_2D = (float **)malloc(size1*sizeof(float*));
+	float * array_1D = (float *)malloc(size1*size2*sizeof(float));
+	for (a=0; a<size1; a++) {
+		array_2D[a] = &array_1D[a*size2];
+	}
+	return array_2D;
+}
+
+// Helper function to free a 2D-array
+void free_2D(float ** array_2D) {
+	free(array_2D[0]);
+	free(array_2D);
+}
+

data/test/examples/neighbourhood/example04_species.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...........neighbourhood/example4.c
+// Author.............Cedric Nugteren
+// Last modified on...16-April-2012
+//
+
+#include <stdio.h>
+
+// This is 'example4', demonstrating naming (optional) in the classification to distingish the two input arrays
+int main(void) {
+	int i;
+	float factor;
+	int size = 512;
+	
+	// Declare input/output arrays
+	float A[size];
+	float B[size];
+	float C[size];
+	
+	// Set the input data
+	for(i=0;i<size;i++) {
+		A[i] = i*2.3;
+		B[i] = i+6.0;
+	}
+	
+	// Perform the computation
+	#pragma scop
+	{
+		#pragma species kernel A[0:size-1]|element ^ B[0:size-1]|neighbourhood(-1:1) -> C[0:size-1]|element
+		for (i = 0; i < size; i++) {
+			factor = A[i] / 100.0;
+			if (i >= 1 && i < size - 1) {
+				C[i] = factor * (B[i - 1] + B[i] + B[i + 1]);
+			} else {
+				C[i] = B[i];
+			}
+		}
+		#pragma species endkernel example04_k1
+	}
+	#pragma endscop
+	
+	// Clean-up and exit the function
+	fflush(stdout);
+	return 0;
+}
+